Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
sublinear space
Description:
A computational complexity bound in which an algorithm uses less than linear memory as a function of input size.
Primary topic:
Complexity and Algorithms in Graphs (30%)
Related topics:
Complexity and Algorithms in Graphs (30%),
Algorithms and Data Compression (27%),
Advanced Database Systems and Queries (11%)
OpenAlex ID:
keywords/sublinear-space
Opportunistic data structures with applications
2002
·
P. Ferragina
, G. Manzini
·
Annual Symposium on Foundations of Computer Science
·
1,376
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
2005
·
Roberto Grossi
, Jeffrey Scott Vitter
·
SIAM Journal on Computing
·
640
Compact Routing with Minimum Stretch
2001
·
Lenore J Cowen
·
Journal of Algorithms
·
270
Practical verified computation with streaming interactive proofs
2012
·
Graham Cormode
, Michael Mitzenmacher
, et al.
·
Conference on Innovations in Theoretical Computer Science
·
255
Augmented Sketch: Faster and More Accurate Stream Processing
2016
·
Pratanu Roy
, Arijit Khan
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
244
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
2019
·
Sepehr Assadi
, MohammadHossein Bateni
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
129
PDF
Densest Subgraph in Dynamic Graph Streams
2015
·
Andrew McGregor
, David Tench
, et al.
·
Lecture notes in computer science
·
125
Finding the frequent items in streams of data
2009
·
Graham Cormode
, Marios Hadjieleftheriou
·
Communications of the ACM
·
114
Estimating PageRank on graph streams
2011
·
Atish Das Sarma
, Sreenivas Gollapudi
, et al.
·
Journal of the ACM
·
107
Compact roundtrip routing in directed networks
2003
·
Lenore J. Cowen
, Christopher G. Wagner
·
Journal of Algorithms
·
94
Fully compressed suffix trees
2011
·
Luís M. S. Russo
, Gonzalo Navarro
, et al.
·
ACM Transactions on Algorithms
·
92
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
2006
·
Graham Cormode
, Flip Korn
, et al.
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
87
Clustering Data Streams
2016
·
Sudipto Guha
, Nina Mishra
·
Data-centric systems and applications
·
86
Exponentially Faster Massively Parallel Maximal Matching
2019
·
Soheil Behnezhad
, Mohammad Taghi Hajiaghayi
, et al.
·
Annual Symposium on Foundations of Computer Science
·
80
Efficient maximal biclique enumeration for large sparse bipartite graphs
2022
·
Lu Chen
, Chengfei Liu
, et al.
·
Proceedings of the VLDB Endowment
·
79
Goal-directed shortest-path queries using precomputed cluster distances
2009
·
Jens Maue
, Peter Sanders
, et al.
·
ACM Journal of Experimental Algorithmics
·
76
On dynamic range reporting in one dimension
2005
·
Christian Worm Mortensen
, Rasmus Pagh
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
75
PDF
Dynamic graph connectivity with improved worst case update time and sublinear space
2015
·
Gibb, David
, Kapron, Bruce
, et al.
·
arXiv (Cornell University)
·
74
PDF
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques
2016
·
Conte, Alessio
, Grossi, Roberto
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
71
PDF
Time–Space Tradeoffs for Satisfiability
2000
·
Lance Fortnow
·
Journal of Computer and System Sciences
·
71
PDF
Near-Optimal Massively Parallel Graph Connectivity
2019
·
Soheil Behnezhad
, Laxman Dhulipala
, et al.
·
Annual Symposium on Foundations of Computer Science
·
69
Better Streaming Algorithms for the Maximum Coverage Problem
2018
·
Andrew McGregor
, Hoa T. Vu
·
Theory of Computing Systems
·
68
PDF
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
2020
·
Artur Czumaj
, Peter Davies
, et al.
·
ACM Transactions on Algorithms
·
59
PDF
Tight bounds for single-pass streaming complexity of the set cover problem
2016
·
Sepehr Assadi
, Sanjeev Khanna
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
58
PDF
Worst-Case Optimal Graph Joins in Almost No Space
2021
·
Diego Arroyuelo
, Aidan Hogan
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
53
Show more works
View as search
Works count:
299
Citation count:
6,822
Year
Topic
Type