Integer representations towards efficient counting in the bit probe model

DOI10.1016/j.jda.2013.11.001zbMath1298.68069OpenAlexW1978464965MaRDI QIDQ2447536

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

Publication date: 28 April 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2013.11.001

zbMATH Keywords

Gray codedata structurebit probe modelinteger representationbinary counter

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Data structures (68P05)

Related Items (1)

Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity

Cites Work

• Integer representation and counting in the bit probe model
• Improved Methods For Generating Quasi-gray Codes
• Should Tables Be Sorted?
• A Survey of Combinatorial Gray Codes
• Dynamic word problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Integer representations towards efficient counting in the bit probe model