Integer representation and counting in the bit probe model
From MaRDI portal
(Redirected from Publication:848941)
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
Cites work
- scientific article; zbMATH DE number 4062572 (Why is no real title available?)
- scientific article; zbMATH DE number 512871 (Why is no real title available?)
- scientific article; zbMATH DE number 1875423 (Why is no real title available?)
- A Gray Code Counter
- Are Bitvectors Optimal?
- Automata, Languages and Programming
- Dynamic word problems
- Efficient Storage and Retrieval by Content and Address of Static Files
- Integer Representation and Counting in the Bit Probe Model
- Lower bounds on the size of selection and rank indexes
- Should Tables Be Sorted?
- The Complexity of Some Simple Retrieval Problems
Cited in
(12)- The counting hierarchy in binary notation
- Regular numeral systems for data structures
- TCAM representations of intervals of integers encoded by binary trees
- A Survey of Data Structures in the Bitprobe Model
- A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
- In-place binary counters
- Data structures for distributed counting
- Integer representations towards efficient counting in the bit probe model
- Integer Representation and Counting in the Bit Probe Model
- Integer representations towards efficient counting in the bit probe model
- An efficient representation of partitions of integers
- Space-optimal quasi-Gray codes with logarithmic read complexity
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)
