Randomized Online Algorithms

Randomized Online Algorithms is an algorithmic paradigm that belongs to the class of online algorithms, distinguished by its use of randomness in decision-making to handle input sequences revealed incrementally over time without knowledge of future events.

250

Publications

13.2K

Citations

526

Authors

226

Institutions

Publications per year

2017–2026

58

Authors

526

  1. NB
    Niv Buchbinder

    Technion – Israel Institute of Technology, Israel

    9 publications · 513 citations

    9

    h-index

  2. JN
    Joseph Naor

    Technion – Israel Institute of Technology, Israel

    9 publications · 540 citations

    9

    h-index

  3. SA
    Susanne Albers

    University of Freiburg, Germany

    7 publications · 463 citations

    7

    h-index

  4. MC
    Minghua Chen

    Chinese University of Hong Kong, Hong Kong SAR China

    6 publications · 293 citations

    6

    h-index

  5. LE
    Leah Epstein

    University of Haifa, Israel

    6 publications · 150 citations

    6

    h-index

1–5 of 526

Venues

  1. arXiv (Cornell University)

    Repository · 18 publications · 424 citations

    13

    h-index

  2. SIAM Journal on Computing

    11 publications · 460 citations

    11

    h-index

  3. Algorithmica

    10 publications · 857 citations

    10

    h-index

  4. Theoretical Computer Science

    8 publications · 344 citations

    9

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 7 publications · 131 citations

    7

    h-index

1–5