Zmiana języka

Projects search

Leveraging Randomization: From Scheduling to AdWords

2020/39/B/ST6/01679

Keywords

Descriptors

  • ST6_004: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna, algorytmy kwantowe
  • ST6_006: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier
  • ST1_014: Matematyka dyskretna i kombinatoryka

Panel

ST6 – Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution

Uniwersytet Wrocławski, Wydział Matematyki i Informatyki

Voivodeship: dolnośląskie

Other projects carried out by the institution »

Principal investigator (from the host institution)

dr Łukasz Jeż

Number of co-investigators in the project: 3

Call

OPUS 20 – announced on 2020-09-15

Amount awarded
1 044 000 PLN
Project start date
2021-07-23
Project end date
2026-07-22
Project duration
60 months (the same as in the proposal)
Project status
Pending project

Project description

Download the project description in a pdf file

Note — project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Information in the final report

Publication in academic press/journals (1)

  1. A phi-Competitive Algorithm for Scheduling Packets with Deadlines

    Authors:
    Pavel Veselý, Marek Chrobak, Łukasz Jeż, Jirí Sgall
    Academic press:
    SIAM Journal on Computing (year: 2022, volume: 51 (5), pages: 1626-1691), Publisher: Society for Industrial and Applied Mathematics (SIAM)
    Status:
    Published
    DOI:
    10.1137/21M1469753 – link to the publication

Articles in post-conference publications (3)

  1. A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs

    Authors:
    Mateusz Basiak, Marcin Bieńkowski, Martin Böhm, Marek Chrobak, Łukasz Jeż, Jirí Sgall, Agnieszka Tatarczuk
    Conference:
    LIPIcs 351, 33rd Annual European Symposium on Algorithms, ESA 2025, LIPIcs 351, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2025, ISBN 978-3-95977-395-9 (year: 2025, volume: 33rd Annual European Symposium on Algorithms, ESA 2025, pages: 76:1-76:15), Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Date:
    conference 15-17.09.2025
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ESA.2025.76 – link to the publication

  2. Online Disjoint Set Covers: Randomization Is Not Necessary.

    Authors:
    Marcin Bieńkowski, Jarosław Byrka, Łukasz Jeż
    Conference:
    LIPIcs 327, 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), ISBN 978-3-95977-365-2 (year: 2025, volume: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), pages: 18:1-18:16), Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Date:
    conference 04-07.03.2025
    Status:
    Published
    DOI:
    10.4230/LIPIcs.STACS.2025.18 – link to the publication

  3. Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems

    Authors:
    János Balogh, György Dósa, Leah Epstein, Lukasz Jez
    Conference:
    Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings. Lecture Notes in Computer Science 13270, Springer 2022, ISBN 978-3-031-06677-1 (year: 2022, volume: 33rd International Workshop on Combinatorial Algorithms (IWOCA), pages: 101-113), Publisher: Springer Nature
    Date:
    conference 07-09.06.2022
    Status:
    Published
    DOI:
    10.1007/978-3-031-06678-8_8 – link to the publication

« New search

Graphic design and implementation: Jakub Piotrowski