Sublinear Algorithms

Sublinear Algorithms is a class of algorithms whose running time grows asymptotically slower than the size of the input, enabling efficient computation on massive datasets by examining only a fraction of the input.

1.3K

Publications

73K

Citations

2.3K

Authors

780

Institutions

Publications per year

2017–2026

266

Authors

2.3K

  1. RR
    Ronitt Rubinfeld

    Massachusetts Institute of Technology, United States

    16 publications · 1.2K citations

    15

    h-index

  2. DR
    Dana Ron

    Tel Aviv University, Israel

    18 publications · 727 citations

    15

    h-index

  3. CS
    C. Seshadhri

    Sandia National Laboratories California, United States

    14 publications · 297 citations

    13

    h-index

  4. KO
    Krzysztof Onak

    Massachusetts Institute of Technology, United States

    11 publications · 335 citations

    11

    h-index

  5. PI
    Piotr Indyk

    Massachusetts Institute of Technology, United States

    14 publications · 743 citations

    11

    h-index

1–5 of 2.3K

Venues

  1. Algorithmica

    46 publications · 2.1K citations

    27

    h-index

  2. SIAM Journal on Computing

    33 publications · 4.3K citations

    24

    h-index

  3. arXiv (Cornell University)

    Repository · 75 publications · 3K citations

    24

    h-index

  4. Mathematical Programming

    32 publications · 1.5K citations

    22

    h-index

  5. Information Processing Letters

    42 publications · 1.9K citations

    21

    h-index

1–5