| 2022 | IWOCA | Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model. | Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal |
| 2019 | COCOA | Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. | Mirza Galib Anwarul Husain Baig, Deepanjan Kesh |
| 2019 | IWOCA | An Improved Scheme in the Two Query Adaptive Bitprobe Model. | Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani |
| 2019 | WALCOM | A Two Query Adaptive Bitprobe Scheme Storing Five Elements. | Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani |
| 2018 | WALCOM | Two New Schemes in the Bitprobe Model. | Mirza Galib Anwarul Husain Baig, Deepanjan Kesh |
| 2017 | COCOA | On Adaptive Bitprobe Schemes for Storing Two Elements. | Deepanjan Kesh |
| 2014 | LATIN | A Divide and Conquer Method to Compute Binomial Ideals. | Deepanjan Kesh, Shashank K. Mehta |
| 2011 | COCOA | A Saturation Algorithm for Homogeneous Binomial Ideals. | Deepanjan Kesh, Shashank K. Mehta |
| 2009 | ISAAC | Generalized Reduction to Compute Toric Ideals. | Deepanjan Kesh, Shashank K. Mehta |
| 2006 | SODA | Simpler algorithm for estimating frequency moments of data streams. | Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, Chandan Saha |