An implicit binomial queue with constant insertion time
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Communications of the ACM
Remark on “Algorithm 246: Graycode [Z]”
ACM Transactions on Mathematical Software (TOMS)
Remark on algorithm 246: Graycode [Z]
ACM Transactions on Mathematical Software (TOMS)
SIAM Journal on Computing
A programming and problem-solving seminar
A programming and problem-solving seminar
Lower bounds on the size of selection and rank indexes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On dynamic bit-probe complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We examine the problem of integer representation in near minimal number of bits so that increment and decrement (and indeed addition and subtraction) can be performed using few bit inspections and fewer bit changes. In particular, we prove a new lower bound of Ω(√n) for the increment and decrement operation, where n is the minimum number of bits required to represent the number. The model of computation we considered is the bit probe model, where the complexity measure counts only the bitwise accesses to the data structure. We present several efficient data structures to represent integer that use a logarithmic number of bit inspections and a constant number of bit changes per operation.