Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
memory lower bounds
Description:
Memory lower bounds are theoretical limits on the minimum storage space required by algorithms, computational processes, or reductions.
Related topics:
Complexity and Algorithms in Graphs (14%),
Advanced Database Systems and Queries (14%),
Distributed systems and fault tolerance (11%),
Optimization and Search Problems (10%)
OpenAlex ID:
keywords/memory-lower-bounds
Maintaining Stream Statistics over Sliding Windows
2002
·
Mayur Datar
, Aristides Gionis
, et al.
·
SIAM Journal on Computing
·
969
Maintaining stream statistics over sliding windows: (extended abstract)
2002
·
Mayur Datar
, Aristides Gionis
, et al.
·
Symposium on Discrete Algorithms
·
283
Space Complexity in Propositional Calculus
2000
·
Michael Alekhnovich
, Eli Ben-Sasson
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
214
Memory requirements for silent stabilization
1999
·
Shlomi Dolev
, Mohamed G. Gouda
, et al.
·
Acta Informatica
·
124
The Variable-Increment Counting Bloom Filter
2013
·
Ori Rottenstreich
, Yossi Kanizo
, et al.
·
IEEE/ACM Transactions on Networking
·
116
How to meet when you forget: log-space rendezvous in arbitrary graphs
2011
·
Jurek Czyzowicz
, Adrian Kosowski
, et al.
·
Distributed Computing
·
102
Multiple Mobile Agent Rendezvous in a Ring
2004
·
Paola Flocchini
, Evangelos Kranakis
, et al.
·
Lecture notes in computer science
·
94
Memory requirement for routing in distributed networks
1996
·
Cyril Gavoille
, Stéphane Pérennès
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
94
PDF
Memory requirements for silent stabilization
1996
·
Shlomi Dolev
, Mohamed G. Gouda
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
68
PDF
Tree exploration with logarithmic memory
2011
·
Christoph Ambühl
, Leszek Gąsieniec
, et al.
·
ACM Transactions on Algorithms
·
64
On the memory requirements of XPath evaluation over XML streams
2004
·
Ziv Bar-Yossef
, Marcus Fontoura
, et al.
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
63
Buffering in query evaluation over XML streams
2005
·
Ziv Bar-Yossef
, Marcus Fontoura
, et al.
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
58
Bloom Filters in Adversarial Environments
2019
·
Moni Naor
, Yogev Eylon
·
ACM Transactions on Algorithms
·
52
PDF
Partial-Observation Stochastic Games: How to Win when Belief Fails
2014
·
Krishnendu Chatterjee
, Laurent Doyen
·
ACM Transactions on Computational Logic
·
50
Tree exploration with logarithmic memory
2007
·
Leszek Gąsieniec
, Andrzej Pelc
, et al.
·
Research Portal (King's College London)
·
49
Memory-sample tradeoffs for linear regression with small error
2019
·
Vatsal Sharan
, Aaron Sidford
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
48
PDF
Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
2012
·
Ofer Feinerman
, Amos Korman
·
Lecture notes in computer science
·
46
PDF
Maintaining significant stream statistics over sliding windows
2006
·
L. K. Lee
, H. F. Ting
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
38
Short Proofs May Be Spacious : Understanding Space in Resolution
2008
·
Jakob Nordström
·
KTH Publication Database DiVA (KTH Royal Institute of Technology)
·
35
Efficient and private distance approximation in the communication and streaming models
2007
·
Piotr Indyk
, David P. Woodruff
·
DSpace@MIT (Massachusetts Institute of Technology)
·
35
Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning
2018
·
Moshkovitz, Dana
, Moshkovitz, Michal
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
34
PDF
Partial-Observation Stochastic Games: How to Win When Belief Fails
2012
·
Krishnendu Chatterjee
, Laurent Doyen
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
34
PDF
Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
2017
·
Lélia Blin
, Sébastien Tixeuil
·
Distributed Computing
·
33
PDF
On the memory requirements of XPath evaluation over XML streams
2006
·
Ziv Bar-Yossef
, Marcus Fontoura
, et al.
·
Journal of Computer and System Sciences
·
33
Tree exploration with little memory
2002
·
Krzysztof Diks
, Pierre Fraigniaud
, et al.
·
Symposium on Discrete Algorithms
·
33
Show more works
View as search
Works count:
144
Citation count:
3,427
Year
Topic
Type