The limits of buffering
From MaRDI portal
Publication:2875172
DOI10.1145/1806689.1806752zbMath1293.68091OpenAlexW2089384111MaRDI QIDQ2875172
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806752
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (3)
This page was built for publication: The limits of buffering