Abstract
In the adaptive bitprobe model, consider the following set membership problem – store subsets of size at most two from an universe of size m, and answer membership queries using two bitprobes. Radhakrishnan et al. [3] proposed a scheme for the problem which takes \(\mathcal {O}(m^{2/3})\) amount of space, and conjectured that this is also the lower bound for the problem. We propose a proof of the lower bound for the problem, but for a restricted class of schemes. This proof hopefully makes progress over the ideas proposed by Radhakrishnan et al. [3] and [4] towards the conjecture.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Buhrman, H., Miltersen, P.B., Radhakrishnan, J., Venkatesh, S.: Are bitvectors optimal? SIAM J. Comput. 31(6), 1723–1744 (2002)
Lewenstein, M., Munro, J.I., Nicholson, P.K., Raman, V.: Improved explicit data structures in the bitprobe model. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 630–641. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44777-2_52
Radhakrishnan, J., Raman, V., Srinivasa Rao, S.: Explicit deterministic constructions for membership in the bitprobe model. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 290–299. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44676-1_24
Radhakrishnan, J., Shah, S., Shannigrahi, S.: Data structures for storing small sets in the bitprobe model. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6347, pp. 159–170. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15781-3_14
Acknowledgement
The authors would like to thank Protyai Ghosal for useful insights and discussions throughout the duration of the work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Kesh, D., Sharma, V.S. (2019). On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements. In: Pal, S., Vijayakumar, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2019. Lecture Notes in Computer Science(), vol 11394. Springer, Cham. https://doi.org/10.1007/978-3-030-11509-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-11509-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11508-1
Online ISBN: 978-3-030-11509-8
eBook Packages: Computer ScienceComputer Science (R0)