Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
space complexity
Description:
A measure of the memory an algorithm requires as a function of the size of its input.
Related topics:
Complexity and Algorithms in Graphs (17%),
Algorithms and Data Compression (12%)
Wikidata ID:
wiki/Q2098905
OpenAlex ID:
keywords/space-complexity
Introduction to the Theory of Computation
1996
·
Michael Sipser
·
ACM SIGACT News
·
2,907
Iterative hard thresholding for compressed sensing
2009
·
Thomas Blumensath
, Mike E. Davies
·
Applied and Computational Harmonic Analysis
·
2,309
PDF
Depth-first iterative-deepening
1985
·
Richard E. Korf
·
Artificial Intelligence
·
1,640
Enhancing the Locality and Breaking the Memory Bottleneck of Transformer on Time Series Forecasting
2019
·
Li, Shiyang
, Jin, Xiaoyong
, et al.
·
arXiv (Cornell University)
·
1,418
PDF
Scheduling multithreaded computations by work stealing
1999
·
Robert D. Blumofe
, Charles E. Leiserson
·
Journal of the ACM
·
1,407
Department of Computer Science
1993
·
Hylke Buisman
, Manuel Gomez-rodriguez
, et al.
·
Journal of Computational and Applied Mathematics
·
1,219
The Space Complexity of Approximating the Frequency Moments
1999
·
Noga Alon
, Yossi Matias
, et al.
·
Journal of Computer and System Sciences
·
1,193
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
2006
·
Alexandr Andoni
, Piotr Indyk
·
Annual Symposium on Foundations of Computer Science
·
1,097
Word problems requiring exponential time(Preliminary Report)
1973
·
L. J. Stockmeyer
, A. R. Meyer
·
ACM Symposium on Theory of Computing (STOC)
·
957
Complexity and Real Computation
1998
·
Lenore Blum
, Felipe Cucker
, et al.
·
Springer eBooks
·
942
Finding All the Elementary Circuits of a Directed Graph
1975
·
Donald B. Johnson
·
SIAM Journal on Computing
·
864
The space complexity of approximating the frequency moments
1996
·
Noga Alon
, Yossi Matias
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
860
Depth-first search and linear graph algorithms
1971
·
Robert Tarjan
·
Annual Symposium on Switching & Automata Theory
·
708
A quick method for finding shortest pairs of disjoint paths
1984
·
J. W. Suurballe
, R. E. Tarjan
·
Networks
·
707
Computational Complexity of Probabilistic Turing Machines
1977
·
John Gill
·
SIAM Journal on Computing
·
694
A survey of longest common subsequence algorithms
2002
·
L. Bergroth
, H. Hakonen
, et al.
·
String Processing and Information Retrieval
·
689
Arc and path consistency revisited
1986
·
Roger Mohr
, Thomas C. Henderson
·
Artificial Intelligence
·
649
Descriptive Complexity
1999
·
Neil Immerman
·
Springer eBooks
·
646
Randomness is Linear in Space
1996
·
Noam Nisan
, David Zuckerman
·
Journal of Computer and System Sciences
·
644
An automata-theoretic approach to branching-time model checking
2000
·
Orna Kupferman
, Moshe Y. Vardi
, et al.
·
Journal of the ACM
·
623
PDF
Music Transformer
2018
·
Huang, Cheng-Zhi Anna
, Vaswani, Ashish
, et al.
·
arXiv (Cornell University)
·
598
PDF
Undirected connectivity in log-space
2008
·
Omer Reingold
·
Journal of the ACM
·
555
Infinite games on finitely coloured graphs with applications to automata on infinite trees
1998
·
Wieslaw Zielonka
·
Theoretical Computer Science
·
515
PDF
An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages
1965
·
Tadao Kasami
·
Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign)
·
502
Main-memory triangle computations for very large (sparse (power-law)) graphs
2008
·
Matthieu Latapy
·
Theoretical Computer Science
·
476
PDF
Show more works
View as search
Works count:
6,770
Citation count:
106,300
Year
Topic
Type