Integer representations towards efficient counting in the bit probe model

DOI10.1007/978-3-642-20877-5_22MaRDI QIDQ3010402zbMATH OpenOpenAlexFDO

Authors Gerth Stølting Brodal, Mark Greve, Vineet Pandey, S. Srinivasa Rao

Publication date 1 July 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20877-5_22

zbMATH Keywords

binary counterbit probe modeldata structureGray codeinteger representation

Mathematics Subject Classification ID

Data structures (68P05)

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

• Improved methods for generating quasi-Gray codes
• Integer representation and counting in the bit probe model

Cited in

(8)

• Regular numeral systems for data structures
• Integer representations towards efficient counting in the bit probe model
• A Survey of Data Structures in the Bitprobe Model
• In-place binary counters
• EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER
• 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
• 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 Q3010402)