Streaming Lower Bounds

Streaming Lower Bounds is a theoretical framework in computational complexity that establishes fundamental limits on the resources, such as space or time, required by any streaming algorithm to solve a given problem within a specified error tolerance.

73

Publications

3.9K

Citations

132

Authors

72

Institutions

Publications per year

2017–2026

18

Authors

132

  1. DP
    David P. Woodruff

    IBM Research - Almaden, United States

    12 publications · 994 citations

    10

    h-index

  2. SA
    Sepehr Assadi

    University of Pennsylvania, United States

    5 publications · 136 citations

    5

    h-index

  3. SK
    Sanjeev Khanna

    University of Pennsylvania, United States

    4 publications · 129 citations

    4

    h-index

  4. PI
    Piotr Indyk

    Massachusetts Institute of Technology, United States

    4 publications · 650 citations

    4

    h-index

  5. VB
    Vladimir Braverman

    Johns Hopkins University, United States

    4 publications · 90 citations

    4

    h-index

1–5 of 132

Venues

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

    Repository · 7 publications · 124 citations

    7

    h-index

  2. arXiv (Cornell University)

    Repository · 4 publications · 102 citations

    4

    h-index

  3. ACM Transactions on Algorithms

    TALG · 4 publications · 341 citations

    4

    h-index

  4. Algorithmica

    4 publications · 158 citations

    4

    h-index

  5. Theoretical Computer Science

    2 publications · 452 citations

    2

    h-index

1–5