Deepanjan Kesh

Publication Activity (10 Years)

Years Active: 2005-2022
Publications (10 Years): 16

Top Topics

Worst Case Time Complexity

Space Complexity

Storage And Retrieval

Database Queries

Top Venues

Discret. Appl. Math.

Publications

Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal
Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model. CoRR (2022)
Deepanjan Kesh, Vidya Sagar Sharma
On the bitprobe complexity of two probe adaptive schemes. Discret. Appl. Math. 319 (2022)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani
Storing four elements in the two query bitprobe model. Discret. Appl. Math. 319 (2022)
Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal
Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model. IWOCA (2022)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh
Two improved schemes in the bitprobe model. Theor. Comput. Sci. 806 (2020)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh
Improved bounds for two query adaptive bitprobe schemes storing five elements. Theor. Comput. Sci. 838 (2020)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani
An Improved Scheme in the Two Query Adaptive Bitprobe Model. IWOCA (2019)
Deepanjan Kesh, Vidya Sagar Sharma
On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements. CALDAM (2019)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh
Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. COCOA (2019)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh
Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. CoRR (2019)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani
A Two Query Adaptive Bitprobe Scheme Storing Five Elements. WALCOM (2019)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani
An Improved Scheme in the Two Query Adaptive Bitprobe Model. CoRR (2018)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh
Two New Schemes in the Bitprobe Model. WALCOM (2018)
Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani
A Two Query Adaptive Bitprobe Scheme Storing Five Elements. CoRR (2018)
Deepanjan Kesh
Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements. FSTTCS (2018)
Deepanjan Kesh
On Adaptive Bitprobe Schemes for Storing Two Elements. COCOA (1) (2017)
Deepanjan Kesh, Shashank K. Mehta
A Divide and Conquer Method to Compute Binomial Ideals. LATIN (2014)
Deepanjan Kesh, Shashank K. Mehta
A saturation algorithm for homogeneous binomial ideals. ACM Commun. Comput. Algebra 45 (1/2) (2011)
Deepanjan Kesh, Shashank K. Mehta
A Saturation Algorithm for Homogeneous Binomial Ideals. COCOA (2011)
Deepanjan Kesh, Shashank K. Mehta
Generalized Reduction to Compute toric ideals. Discret. Math. Algorithms Appl. 2 (1) (2010)
Deepanjan Kesh, Shashank K. Mehta
Generalized Reduction to Compute Toric Ideals. ISAAC (2009)
Deepanjan Kesh, Shashank K. Mehta
Polynomial irreducibility testing through Minkowski summand computation. CCCG (2008)
Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, Chandan Saha
Simpler algorithm for estimating frequency moments of data streams. SODA (2006)
Sumit Ganguly, Deepanjan Kesh, Chandan Saha
Practical Algorithms for Tracking Database Join Sizes. FSTTCS (2005)