Integer Representations towards Efficient Counting in the Bit Probe Model

  • Gerth Stølting Brodal
  • Mark Greve
  • Vineet Pandey
  • Satti Srinivasa Rao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6648)

Abstract

We consider the problem of representing numbers in close to optimal space and supporting increment, decrement, addition and subtraction operations efficiently. We study the problem in the bit probe model and analyse the number of bits read and written to perform the operations, both in the worst-case and in the average-case. A counter is space-optimal if it represents any number in the range [0,...,2n − 1] using exactly n bits. We provide a space-optimal counter which supports increment and decrement operations by reading at most n − 1 bits and writing at most 3 bits in the worst-case. To the best of our knowledge, this is the first such representation which supports these operations by always reading strictly less than n bits. For redundant counters where we only need to represent numbers in the range [0,...,L] for some integer L < 2n − 1 using n bits, we define the efficiency of the counter as the ratio between L + 1 and 2n. We present various representations that achieve different trade-offs between the read and write complexities and the efficiency. We also give another representation of integers that uses n + O(logn ) bits to represent integers in the range [0,...,2n − 1] that supports efficient addition and subtraction operations, improving the space complexity of an earlier representation by Munro and Rahman [Algorithmica, 2010].

Keywords

Data structure Gray code Bit probe model Binary counter Integer representation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bose, P., Carmi, P., Jansens, D., Maheshwari, A., Morin, P., Smid, M.H.M.: Improved methods for generating quasi-gray codes. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 224–235. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    Fredman, M.L.: Observations on the complexity of generating quasi-gray codes. SIAM Journal on Computing 7(2), 134–146 (1978)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Gray, F.: Pulse code communications. U.S. Patent (2632058) (1953)Google Scholar
  4. 4.
    Ziaur Rahman, M., Ian Munro, J.: Integer representation and counting in the bit probe model. Algorithmica 56(1), 105–127 (2010)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Gerth Stølting Brodal
    • 1
  • Mark Greve
    • 1
  • Vineet Pandey
    • 2
  • Satti Srinivasa Rao
    • 3
  1. 1.MADALGO, Department of Computer ScienceAarhus UniversityÅrhus NDenmark
  2. 2.Computer Science & Information SystemsBITS PilaniIndia
  3. 3.School of Computer Science and EngineeringSeoul National UniversityRepublic of Korea

Personalised recommendations