Integer representation and counting in the bit probe model

DOI10.1007/s00453-008-9247-2zbMath1187.68015OpenAlexW1685382382MaRDI QIDQ848941

J. Ian Munro, M. Ziaur Rahman

Publication date: 23 February 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9247-2

zbMATH Keywords

countingGray codedata structurebit probe model

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Data structures (68P05)

Related Items (5)

Regular numeral systems for data structures ⋮ Integer representations towards efficient counting in the bit probe model ⋮ Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity ⋮ Integer Representations towards Efficient Counting in the Bit Probe Model ⋮ A Survey of Data Structures in the Bitprobe Model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Are Bitvectors Optimal?
• Should Tables Be Sorted?
• The Complexity of Some Simple Retrieval Problems
• Dynamic word problems
• Efficient Storage and Retrieval by Content and Address of Static Files
• Integer Representation and Counting in the Bit Probe Model
• A Gray Code Counter
• Automata, Languages and Programming

This page was built for publication: Integer representation and counting in the bit probe model