Abstract
We look at time-space tradeoffs for the static membership problem in the bit-probe model. The problem is to represent a set of size up to n from a universe of size m using a small number of bits so that given an element of the universe, its membership in the set can be determined with as few bit probes to the representation as possible.
We show several deterministic upper bounds for the case when the number of bit probes, is small, by explicit constructions, culminating in one that uses o(m) bits of space where membership can be determined with [lg lgn] + 2 adaptive bit probes. We also show two tight lower bounds on space for a restricted two probe adaptive scheme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Brodnik and J. I. Munro, “Membership in constant time and almost minimum space”, SIAM Journal on Computing, 28(5), 1628–1640 (1999).
H. Buhrman, P. B. Miltersen, J. Radhakrishnan and S. Venkatesh, “Are Bitvectors Optimal?”, Proceedings of Symposium on Theory of Computing (2000) 449–458.
E. D. Demaine, J. I. Munro, V. Raman and S. S. Rao, “Beating Bitvectors with Oblivious Bitprobes”, I.M.Sc. Technical Report (2001).
M. L. Fredman, J. Komlós and E. Szemerédi, “Storing a sparse table with O(1) access time”, Journal of the Association for Computing Machinery, 31 (1984) 538–544.
Rasmus Pagh, “Low redundancy in dictionaries with O(1) worst case lookup time”, Proceedings of the International Colloquium on Automata, Languages and Programming, LNCS 1644 (1999) 595–604.
Rasmus Pagh, “On the Cell Probe Complexity of Membership and Perfect Hashing”, Proceedings of Symposium on Theory of Computing (2001).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Radhakrishnan, J., Raman, V., Srinivasa Rao, S. (2001). Explicit Deterministic Constructions for Membership in the Bitprobe Model. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_24
Download citation
DOI: https://doi.org/10.1007/3-540-44676-1_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42493-2
Online ISBN: 978-3-540-44676-7
eBook Packages: Springer Book Archive