Integer Representations towards Efficient Counting in the Bit Probe Model

DOI10.1007/978-3-642-20877-5_22zbMath1331.68057OpenAlexW1698590857MaRDI QIDQ3010402

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

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

Gray codedata structurebit probe modelinteger representationbinary counter

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Regular numeral systems for data structures ⋮ A Survey of Data Structures in the Bitprobe Model

Cites Work

• Integer representation and counting in the bit probe model
• Improved Methods For Generating Quasi-gray Codes

This page was built for publication: Integer Representations towards Efficient Counting in the Bit Probe Model