The Complexity of Some Simple Retrieval Problems
From MaRDI portal
Publication:4061951
DOI10.1145/321892.321899zbMath0305.68024OpenAlexW2006949464MaRDI QIDQ4061951
Richard A. Flower, Peter Eliaš
Publication date: 1975
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321892.321899
Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)
Related Items (4)
The cell probe complexity of succinct data structures ⋮ Integer representation and counting in the bit probe model ⋮ Flexible indexing of repetitive collections ⋮ A Survey of Data Structures in the Bitprobe Model
This page was built for publication: The Complexity of Some Simple Retrieval Problems