Advertisement

On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements

  • Deepanjan KeshEmail author
  • Vidya Sagar Sharma
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11394)

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.

Keywords

Data structures Bitprobe model Adaptive scheme Lower bound 

Notes

Acknowledgement

The authors would like to thank Protyai Ghosal for useful insights and discussions throughout the duration of the work.

References

  1. 1.
    Buhrman, H., Miltersen, P.B., Radhakrishnan, J., Venkatesh, S.: Are bitvectors optimal? SIAM J. Comput. 31(6), 1723–1744 (2002)MathSciNetCrossRefGoogle Scholar
  2. 2.
    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_52CrossRefGoogle Scholar
  3. 3.
    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_24CrossRefGoogle Scholar
  4. 4.
    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_14CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology GuwahatiGuwahatiIndia
  2. 2.School of Technology and Computer ScienceTata Institute of Fundamental ResearchMumbaiIndia

Personalised recommendations