Integer representation and counting in the bit probe model

DOI10.1007/S00453-008-9247-2zbMATH Open1187.68015OpenAlexW1685382382MaRDI QIDQ848941FDOQ848941

Authors: M. Ziaur Rahman, J. Ian Munro 

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

Recommendations

• Integer Representation and Counting in the Bit Probe Model
• Integer representations towards efficient counting in the bit probe model
• Integer representations towards efficient counting in the bit probe model
• A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
• In-place binary counters

zbMATH Keywords

data structureGray codecountingbit probe model

Mathematics Subject Classification ID

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

Cites Work

• Efficient Storage and Retrieval by Content and Address of Static Files
• Should Tables Be Sorted?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds on the size of selection and rank indexes
• Are Bitvectors Optimal?
• The Complexity of Some Simple Retrieval Problems
• Dynamic word problems
• Title not available (Why is that?)
• Integer Representation and Counting in the Bit Probe Model
• A Gray Code Counter
• Automata, Languages and Programming

Cited In (12)

• Space-optimal quasi-Gray codes with logarithmic read complexity
• TCAM representations of intervals of integers encoded by binary trees
• Integer Representation and Counting in the Bit Probe Model
• Integer representations towards efficient counting in the bit probe model
• A Survey of Data Structures in the Bitprobe Model
• In-place binary counters
• The counting hierarchy in binary notation
• Regular numeral systems for data structures
• Integer representations towards efficient counting in the bit probe model
• An efficient representation of partitions of integers
• Data structures for distributed counting
• A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model

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

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