Integer Representation and Counting in the Bit Probe Model

DOI10.1007/978-3-540-77120-3_3zbMath1193.68091OpenAlexW4206681002MaRDI QIDQ5387741

J. Ian Munro, M. Ziaur Rahman

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_3

zbMATH Keywords

lower boundGray codedata structurebit probe model

Mathematics Subject Classification ID

Related Items (1)

Integer representation and counting in the bit probe model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Are Bitvectors Optimal?
• Intersection Theorems for Systems of Sets
• Should Tables Be Sorted?
• Dynamic word problems
• Automata, Languages and Programming

This page was built for publication: Integer Representation and Counting in the Bit Probe Model