Online Algorithms

Online Algorithms is an algorithmic paradigm in which a problem instance is solved incrementally by making irrevocable decisions in real-time under the constraint that future input data are unknown, distinguishing it from offline algorithms that have complete information a priori.

2.9K

Publications

162.8K

Citations

5.8K

Authors

1.4K

Institutions

Publications per year

2017–2026

1.1K

Authors

5.8K

  1. EH
    Elad Hazan

    Princeton University, United States

    32 publications · 11.4K citations

    26

    h-index

  2. SC
    Steven C. H. Hoi

    Nanyang Technological University, Singapore

    38 publications · 3.1K citations

    24

    h-index

  3. PZ
    Peilin Zhao

    Tencent (China), China

    38 publications · 3K citations

    23

    h-index

  4. AR
    Alexander Rakhlin

    University of Pennsylvania, United States

    18 publications · 1.3K citations

    16

    h-index

  5. SS
    Shai Shalev‐Shwartz

    Hebrew University of Jerusalem, Israel

    17 publications · 4.3K citations

    16

    h-index

1–5 of 5.8K

Venues

  1. arXiv (Cornell University)

    Repository · 281 publications · 9.9K citations

    49

    h-index

  2. IEEE Transactions on Signal Processing

    39 publications · 3.4K citations

    28

    h-index

  3. Neurocomputing

    44 publications · 3K citations

    28

    h-index

  4. 25

    h-index

  5. IEEE Transactions on Automatic Control

    27 publications · 1.4K citations

    24

    h-index

1–5