Integer representations towards efficient counting in the bit probe model
From MaRDI portal
Publication:2447536
Recommendations
- Integer representations towards efficient counting in the bit probe model
- Integer representation and counting in the bit probe model
- Integer Representation and 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
- A Survey of Combinatorial Gray Codes
- Dynamic word problems
- scientific article; zbMATH DE number 46318 (Why is no real title available?)
- scientific article; zbMATH DE number 512871 (Why is no real title available?)
- scientific article; zbMATH DE number 2176112 (Why is no real title available?)
- Improved methods for generating quasi-Gray codes
- Integer representation and counting in the bit probe model
- Should Tables Be Sorted?
Cited in
(8)- In-place binary counters
- Integer representations towards efficient counting in the bit probe model
- EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER
- Space-optimal quasi-Gray codes with logarithmic read complexity
- A linear lower bound for incrementing a space-optimal integer representation in the bit-probe model
- Integer Representation and Counting in the Bit Probe Model
- Data structures for distributed counting
- Integer representation and counting in the bit probe model
This page was built for publication: Integer representations towards efficient 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 Q2447536)