Deterministic Online Algorithms

Deterministic Online Algorithms is a class of online algorithms that make irreversible decisions in a sequential manner without knowledge of future inputs and operate under a fixed, predictable strategy without incorporating randomness.

134

Publications

5.3K

Citations

291

Authors

143

Institutions

Publications per year

2017–2026

30

Authors

291

  1. MC
    Minghua Chen

    Chinese University of Hong Kong, Hong Kong SAR China

    11 publications · 386 citations

    11

    h-index

  2. SA
    Susanne Albers

    University of Freiburg, Germany

    7 publications · 397 citations

    7

    h-index

  3. MC
    Marek Chrobák

    University of California, Riverside, United States

    6 publications · 402 citations

    6

    h-index

  4. QL
    Qiulin Lin

    Chinese University of Hong Kong, Hong Kong SAR China

    5 publications · 104 citations

    5

    h-index

  5. MB
    Marcin Bieńkowski

    University of Wrocław, Poland

    5 publications · 84 citations

    5

    h-index

1–5 of 291

Venues

  1. ACM Transactions on Algorithms

    TALG · 15 publications · 616 citations

    13

    h-index

  2. arXiv (Cornell University)

    Repository · 6 publications · 138 citations

    6

    h-index

  3. Symposium on Discrete Algorithms

    Conference · 6 publications · 298 citations

    6

    h-index

  4. SIAM Journal on Discrete Mathematics

    5 publications · 336 citations

    5

    h-index

  5. SIAM Journal on Computing

    3 publications · 144 citations

    3

    h-index

1–5