Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity

DOI10.1007/978-3-540-70575-8_7MaRDI QIDQ3521909zbMATH OpenOpenAlexFDO

Authors Yitong Yin

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_7

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Cell-Probe Proofs
• Certificates in Data Structures
• Cell-probe lower bounds for the partial match problem
• Cell-probe lower bounds for the partial match problem
• The cell probe complexity of succinct data structures

Cited in

(4)

• Cell-Probe Proofs
• On the cell probe complexity of membership and perfect hashing
• Cell-probe lower bounds for the partial match problem
• On the cell probe complexity of polynomial evaluation

This page was built for publication: Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521909)