Sublinear Space Algorithms
Sublinear Space Algorithms is a class of algorithms in streaming computation that belongs to the broader category of space-bounded algorithms, distinguished by its requirement of using memory space that is asymptotically smaller than the input size, typically o(n), to process massive data streams efficiently.
52
Publications
1.9K
Citations
100
Authors
58
Institutions
Publications per year
2017–2026
14
Parents
52
Sublinear time algorithms for metric space problems
Piotr Indyk · 1999 · 202 citations
A sublinear algorithm for approximate keyword searching
Eugene W. Myers · Algorithmica · 1994 · 166 citations
Characterizing storage workloads with counter stacks
Jake Wires, Stephen Ingram, Zachary Drudi et al. · Operating Systems Design and Implementation · 2014 · 103 citations
Drawing planar graphs using the lmc-ordering
Goos Kant · 1992 · 76 citations
1–5 of 52
100
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 100
58
University of Pennsylvania
Philadelphia, United States
5 h-index
7 publications
369 citations
Google (United States)
Mountain View, United States
3 h-index
4 publications
69 citations

Bar-Ilan University
Ramat Gan, Israel
3 h-index
4 publications
71 citations
IBM (United States)
Armonk, United States
3 h-index
4 publications
170 citations

University of Waterloo
Waterloo, Canada
3 h-index
4 publications
70 citations
AT&T (United States)
Bedminster, United States
3 h-index
4 publications
302 citations

Sapienza University of Rome
Rome, Italy
3 h-index
9 publications
333 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
5 publications
209 citations
1–8 of 58
3 publications · 107 citations
3
h-index
3 publications · 54 citations
3
h-index
TALG · 2 publications · 50 citations
2
h-index
Conference · 2 publications · 67 citations
2
h-index
2 publications · 61 citations
2
h-index
1–5