Publications also available at DBLP , Google Scholar and Scopus.

Journals:

1. Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, and Chirag Sodani. Storing four ele- ments in the two query bitprobe model. Discrete Applied Mathematics, 319:121–131, 2022.

2. Mirza Galib Anwarul Husain Baig and Deepanjan Kesh. Improved bounds for two query adaptive bitprobe schemes storing five elements. Theoretical Computer Science, 838:208 – 230, 2020.

3. Mirza Galib Anwarul Husain Baig and Deepanjan Kesh. Two improved schemes in the bitprobe model. Theoretical Computer Science, 806:543 – 552, 2020.

Conferences:

1. Mirza Galib Anwarul Husain Baig and Deepanjan Kesh. Improved bounds for two query adaptive bitprobe schemes storing five elements. The 13th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2019., 2019.

2. Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, and Chirag Sodani. An improved scheme in the two query adaptive bitprobe model. In Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings, pages 22– 34, 2019.

3. Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, and Chirag Sodani. A two query adaptive bitprobe scheme storing five elements. In WALCOM: Algorithms and Com- putation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings, pages 317–328, 2019.

4. Mirza Galib Anwarul Husain Baig and Deepanjan Kesh. Two new schemes in the bit- probe model. In WALCOM: Algorithms and Computation - 12th International Conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018, Proceedings, pages 68–79, 2018.