1. Alon, N., Feige, U.: On the power of two, three and four probes. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, 4–6 January 2009, pp. 346–354 (2009)
2. Lecture Notes in Computer Science;MGAH Baig,2018
3. Baig, M.G.A.H., Kesh, D., Sodani, C.: An improved scheme in the two query adaptive bitprobe model. CoRR abs/1812.04802 (2018).
http://arxiv.org/abs/1812.04802
4. Garg, M.: The bit-probe complexity of set membership. Ph.D. thesis, School of Technology and Computer Science, Tata Institute of Fundamental Research, Homi Bhabha Road, Navy Nagar, Colaba, Mumbai 400005, India (2016)
5. Garg, M., Radhakrishnan, J.: Set membership with a few bit probes. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, 4–6 January 2015, pp. 776–784 (2015)