Keyword

memory lower bounds

Description: Memory lower bounds are theoretical limits on the minimum storage space required by algorithms, computational processes, or reductions.
OpenAlex ID: keywords/memory-lower-bounds
2002 · Mayur Datar, Aristides Gionis, et al. · SIAM Journal on Computing · 969
2002 · Mayur Datar, Aristides Gionis, et al. · Symposium on Discrete Algorithms · 283
2000 · Michael Alekhnovich, Eli Ben-Sasson, et al. · ACM Symposium on Theory of Computing (STOC) · 214
1999 · Shlomi Dolev, Mohamed G. Gouda, et al. · Acta Informatica · 124
2013 · Ori Rottenstreich, Yossi Kanizo, et al. · IEEE/ACM Transactions on Networking · 116
2011 · Jurek Czyzowicz, Adrian Kosowski, et al. · Distributed Computing · 102
2004 · Paola Flocchini, Evangelos Kranakis, et al. · Lecture notes in computer science · 94
1996 · Cyril Gavoille, Stéphane Pérennès · ACM Symposium on Principles of Distributed Computing (PODC) · 94
1996 · Shlomi Dolev, Mohamed G. Gouda, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 68
2011 · Christoph Ambühl, Leszek Gąsieniec, et al. · ACM Transactions on Algorithms · 64
2004 · Ziv Bar-Yossef, Marcus Fontoura, et al. · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 63
2005 · Ziv Bar-Yossef, Marcus Fontoura, et al. · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 58
2019 · Moni Naor, Yogev Eylon · ACM Transactions on Algorithms · 52
2014 · Krishnendu Chatterjee, Laurent Doyen · ACM Transactions on Computational Logic · 50
2007 · Leszek Gąsieniec, Andrzej Pelc, et al. · Research Portal (King's College London) · 49
2019 · Vatsal Sharan, Aaron Sidford, et al. · ACM Symposium on Theory of Computing (STOC) · 48
2012 · Ofer Feinerman, Amos Korman · Lecture notes in computer science · 46
2006 · L. K. Lee, H. F. Ting · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 38
2008 · Jakob Nordstr”öm · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 35
2007 · Piotr Indyk, David P. Woodruff · DSpace@MIT (Massachusetts Institute of Technology) · 35
2018 · Moshkovitz, Dana, Moshkovitz, Michal · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 34
2012 · Krishnendu Chatterjee, Laurent Doyen · ACM/IEEE Symposium on Logic in Computer Science (LICS) · 34
2006 · Ziv Bar-Yossef, Marcus Fontoura, et al. · Journal of Computer and System Sciences · 33
2002 · Krzysztof Diks, Pierre Fraigniaud, et al. · Symposium on Discrete Algorithms · 33
Works count: 144
Citation count: 3,427
Year
Topic
Type