Optimal bounds for the predecessor problem
From MaRDI portal
Publication:2819557
DOI10.1145/301250.301323zbMath1346.68099OpenAlexW2055706406MaRDI QIDQ2819557
Publication date: 29 September 2016
Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/301250.301323
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Compressed data structures: Dictionaries and data-aware measures ⋮ Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space ⋮ LZ-End Parsing in Linear Time ⋮ Succinct Color Searching in One Dimension
This page was built for publication: Optimal bounds for the predecessor problem
