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
Parents
73
On graph problems in a semi-streaming model
Joan Feigenbaum, Sampath Kannan, Andrew McGregor et al. · Theoretical Computer Science · 2005 · 422 citations
Numerical linear algebra in the streaming model
Kenneth L. Clarkson, David P. Woodruff · 2009 · 327 citations
Maintaining stream statistics over sliding windows: (extended abstract)
Mayur Datar, Aristides Gionis, Piotr Indyk et al. · 2002 · 256 citations
Optimal approximations of the frequency moments of data streams
Piotr Indyk, David P. Woodruff · 2005 · 227 citations
1–5 of 73
132
10
h-index
5
h-index
4
h-index
4
h-index
4
h-index
1–5 of 132
72
IBM (United States)
Armonk, United States
7 h-index
10 publications
1.2K citations
IBM Research - Almaden
San Jose, United States
7 h-index
10 publications
1.3K citations
Rutgers, The State University of New Jersey
New Brunswick, United States
5 h-index
7 publications
435 citations
University of Pennsylvania
Philadelphia, United States
5 h-index
11 publications
1.6K citations
Yale University
New Haven, United States
5 h-index
9 publications
1.2K citations

Johns Hopkins University
Baltimore, United States
5 h-index
8 publications
186 citations
Princeton University
Princeton, United States
4 h-index
10 publications
255 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
6 publications
819 citations
1–8 of 72
Repository · 7 publications · 124 citations
7
h-index
Repository · 4 publications · 102 citations
4
h-index
TALG · 4 publications · 341 citations
4
h-index
4 publications · 158 citations
4
h-index
2 publications · 452 citations
2
h-index
1–5