Assistant Professor

Department of Computer Science and Engineering

Indian Institute of Technology Guwahati

Guwahati, Assam

India

Pincode - 781039

** Research Interest ** - Data Structures and Algorithms, Computational Commutative Algebra

- Mirza Galib Anwarul Husain Baig and Deepanjan Kesh : Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. Theoretical Computer Science. Accepted (2020).
- Mirza Galib Anwarul Husain Baig and Deepanjan Kesh : Two improved schemes in the bitprobe model. Theoretical Computer Science. 806:543-552 (2020).
- Deepanjan Kesh and Shashank K. Mehta : A saturation algorithm for homogeneous binomial ideals. ACM Communications in Computer Algebra. 45(1/2) : 121-122. (2011).
- Deepanjan Kesh and Shashank K. Mehta : Generalized Reduction to Compute toric ideals. Discrete Mathematics, Algorithms, and Applications. 2(1) : 45-60. (2010).

- Deepanjan Kesh and Vidya Sagar Sharma : On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements. The 5th International Conference on Algorithms and Discrete Applied Mathematics, February 14-16, 2019, Kharagpur, India. pp. 53-64. (CALDAM 2019).
- Mirza Galib Anwarul Husain Baig and Deepanjan Kesh : Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. The 13th International Conference on Combinatorial Optimization and Applications, December 13-15, 2019, Xiamen, China. pp. 13-25. (COCOA 2019).
- Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, and Chirag Sodani : An Improved Scheme in the Two Query Adaptive Bitprobe Model. The 30th International Workshop on Combinatorial Algorithms, July 23-25, 2019, Pisa, Italy. pp. 22-34. (IWOCA 2019).
- Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, and Chirag Sodani : A Two Query Adaptive Bitprobe Scheme Storing Five Elements. The 13th International Conference and Workshops on Algorithms and Computation, February 27 - March 2, 2019, Guwahati, India. pp. 317-328. (WALCOM 2019).
- Deepanjan Kesh : Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements. The 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, December 11-13, 2018, Ahmedabad, India. pp. 122(12): 1-12. (FSTTCS 2018).
- Mirza Galib Anwarul Husain Baig and Deepanjan Kesh : Two New Schemes in the Bitprobe Model. The 12th International Conference and Workshops on Algorithms and Computation, March 3-5, 2018, Dhaka, Bangladesh. pp. 68-79. (WALCOM 2018).
- Deepanjan Kesh : On Adaptive Bitprobe Schemes for Storing Two Elements. The 11th International Conference on Combinatorial Optimization and Applications, December 16-18, 2017, Shanghai, China. pp. 471-479. (COCOA 2017).
- Deepanjan Kesh and Shashank K. Mehta : A Divide and Conquer Method to Compute Binomial Ideals. The 11th Latin American Theoretical Informatics Symposium, March 31 - April 4, 2014, Montevideo, Uruguay. pp. 648-659. (LATIN 2014).
- Deepanjan Kesh and Shashank K. Mehta : A Saturation Algorithm for Homogeneous Binomial Ideals. The 5th International Conference on Combinatorial Optimization and Applications, August 4-6, 2011, Zhangjiajie, China. pp. 357-371. (COCOA 2011).
- Deepanjan Kesh and Shashank K. Mehta : Generalized Reduction to Compute Toric Ideals. 20th International Symposium on Algorithms and Computation, December 16-18, 2009, Honolulu, Hawaii, USA. pp. 483-492. (ISAAC 2009).
- Deepanjan Kesh and Shashank K. Mehta : Polynomial irreducibility testing through Minkowski summand computation. Proceedings of the 20th Annual Canadian Conference on Computational Geometry, August 13-15, 2008, Montreal, Canada. (CCCG 2008).
- Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, and Chandan Saha : Simpler Algorithm for Estimating Frequency Moments of Data Streams. The 17th Annual ACM-SIAM Symposium on Discrete Algorithms, January 22-26, 2006, Miami, Florida, USA. pp. 708-713. (SODA 2006).
- Sumit Ganguly, Deepanjan Kesh, and Chandan Saha : Practical Algorithms for Tracking Database Join Sizes. The 25th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, December 15-18, 2005, Hyderabad, India. pp. 297-309. (FSTTCS 2005).

- Mirza Galib Anwarul Husain Baig (2014 - )
- Mirza Galib Anwarul Husain Baig and Deepanjan Kesh : Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. Theoretical Computer Science. Accepted (2020).
- Mirza Galib Anwarul Husain Baig and Deepanjan Kesh : Two improved schemes in the bitprobe model. Theoretical Computer Science. 806:543-552 (2020).
- Mirza Galib Anwarul Husain Baig and Deepanjan Kesh : Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. The 13th International Conference on Combinatorial Optimization and Applications, December 13-15, 2019, Xiamen, China. pp. 13-25. (COCOA 2019).
- Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, and Chirag Sodani : An Improved Scheme in the Two Query Adaptive Bitprobe Model. The 30th International Workshop on Combinatorial Algorithms, July 23-25, 2019, Pisa, Italy. pp. 22-34. (IWOCA 2019).
- Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, and Chirag Sodani : A Two Query Adaptive Bitprobe Scheme Storing Five Elements. The 13th International Conference and Workshops on Algorithms and Computation, February 27 - March 2, 2019, Guwahati, India. pp. 317-328. (WALCOM 2019).
- Mirza Galib Anwarul Husain Baig and Deepanjan Kesh : Two New Schemes in the Bitprobe Model. The 12th International Conference and Workshops on Algorithms and Computation, March 3-5, 2018, Dhaka, Bangladesh. pp. 68-79. (WALCOM 2018).

- Shavi Gupta (2018 - 20)
- Ankit (2018 - 20)
- Chirag Sodani (2016 - 18)
- Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, and Chirag Sodani : An Improved Scheme in the Two Query Adaptive Bitprobe Model. The 30th International Workshop on Combinatorial Algorithms, July 23-25, 2019, Pisa, Italy. pp. 22-34. (IWOCA 2019).
- Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, and Chirag Sodani : A Two Query Adaptive Bitprobe Scheme Storing Five Elements. The 13th International Conference and Workshops on Algorithms and Computation, February 27 - March 2, 2019, Guwahati, India. pp. 317-328. (WALCOM 2019).
- Ongfa Wakhet (2016 - 18)
- Vidya Sagar Sharma (2015 - 17)
- Deepanjan Kesh and Vidya Sagar Sharma : On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements. The 5th International Conference on Algorithms and Discrete Applied Mathematics, February 14-16, 2019, Kharagpur, India. pp. 53-64. (CALDAM 2019).
- Protyai Ghosal (2015 - 17)
- Devendra Kumar Bharti (2015 - 17)
- Arif Ali AP (2012 - 14)
- Ambadas Devrao Jadhav (2012 - 14)

- Ankur Seth (2013 - )
- Abhishek Kumar (2013 - 2017)
- Harsh Mehta (2010 - 14)
- Vimal Bhushan Choudhary (2010 - 17)
- Kartik Kale (2010 - 14)
- Kethavath Gopal (2010 - 14)

- Microsoft Research India PhD Fellow 2006.
- The SAARC/IAESTE-Japan Academic Internship Program 2008.

- CS101 : Introduction to Computing
- CS202 : Discrete Mathematics
- CS203 : Algorithms and Data Structures
- CS203 : Formal Languages and Automata Theory (Old Curriculum)
- CS205M : Theoretical Foundations of Computer Science
- CS301 : Theory of Computation
- CS503 : Randomized Algorithms