Deepanjan Kesh

According to our database, Deepanjan Kesh authored at least 17 papers between 2005 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

On the bitprobe complexity of two probe adaptive schemes.

Deepanjan Kesh, Vidya Sagar Sharma

Discret. Appl. Math., 2022

Storing four elements in the two query bitprobe model.

Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani

Discret. Appl. Math., 2022

Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model.

Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2020

Improved bounds for two query adaptive bitprobe schemes storing five elements.

Mirza Galib Anwarul Husain Baig, Deepanjan Kesh

Theor. Comput. Sci., 2020

Two improved schemes in the bitprobe model.

Mirza Galib Anwarul Husain Baig, Deepanjan Kesh

Theor. Comput. Sci., 2020

2019

A Two Query Adaptive Bitprobe Scheme Storing Five Elements.

Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019

An Improved Scheme in the Two Query Adaptive Bitprobe Model.

Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements.

Deepanjan Kesh, Vidya Sagar Sharma

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Two New Schemes in the Bitprobe Model.

Mirza Galib Anwarul Husain Baig, Deepanjan Kesh

Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements.

Deepanjan Kesh

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

On Adaptive Bitprobe Schemes for Storing Two Elements.

Deepanjan Kesh

Proceedings of the Combinatorial Optimization and Applications, 2017

2014

A Divide and Conquer Method to Compute Binomial Ideals.

Deepanjan Kesh, Shashank K. Mehta

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2011

A saturation algorithm for homogeneous binomial ideals.

Deepanjan Kesh, Shashank K. Mehta

ACM Commun. Comput. Algebra, 2011

2010

Generalized Reduction to Compute toric ideals.

Deepanjan Kesh, Shashank K. Mehta

Discret. Math. Algorithms Appl., 2010

2008

Polynomial irreducibility testing through Minkowski summand computation.

Deepanjan Kesh, Shashank K. Mehta

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2006

Simpler algorithm for estimating frequency moments of data streams.

Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, Chandan Saha

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Practical Algorithms for Tracking Database Join Sizes.

Sumit Ganguly, Deepanjan Kesh, Chandan Saha

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005