Get started
Author

Deepanjan Kesh

Observed names: DEEPANJAN KESH, Kesh, Deepanjan
OpenAlex ID: A5054298871
Simpler algorithm for estimating frequency moments of data streams
2006 · Lakshminath Bhuvanagiri, Šumit Ganguly, et al. · 86
Simpler algorithm for estimating frequency moments of data streams
2006 · Lakshminath Bhuvanagiri, Sumit Ganguly, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 34
Practical Algorithms for Tracking Database Join Sizes
2005 · Sumit Ganguly, Deepanjan Kesh, et al. · Lecture notes in computer science · 19
Two New Schemes in the Bitprobe Model
2018 · Mirza Galib Anwarul Husain Baig, Deepanjan Kesh · Lecture notes in computer science · 8
Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements
2018 · Kesh, Deepanjan · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 5
PDF
On Adaptive Bitprobe Schemes for Storing Two Elements
2017 · Deepanjan Kesh · Lecture notes in computer science · 5
Generalized Reduction to Compute Toric Ideals
2009 · Deepanjan Kesh, Shashank K. Mehta · Lecture notes in computer science · 4
An Improved Scheme in the Two Query Adaptive Bitprobe Model
2019 · Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, et al. · Lecture notes in computer science · 3
PDF
Polynomial irreducibility testing through Minkowski summand computation
2008 · Deepanjan Kesh, Shashank K. Mehta · 3
On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements
2019 · Deepanjan Kesh, Vidya Sagar Sharma · Lecture notes in computer science · 2
A Two Query Adaptive Bitprobe Scheme Storing Five Elements
2018 · Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, et al. · Lecture notes in computer science · 2
A Saturation Algorithm for Homogeneous Binomial Ideals
2011 · Deepanjan Kesh, Shashank K. Mehta · Lecture notes in computer science · 2
On the bitprobe complexity of two probe adaptive schemes
2021 · Deepanjan Kesh, Vidya Sagar Sharma · Discrete Applied Mathematics · 1
Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements
2019 · Mirza Galib Anwarul Husain Baig, Deepanjan Kesh · Lecture notes in computer science · 1
PDF
Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model
2022 · Sreshth Aggarwal, Deepanjan Kesh, et al. · Lecture notes in computer science
PDF
Storing four elements in the two query bitprobe model
2021 · Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, et al. · Discrete Applied Mathematics
Two improved schemes in the bitprobe model
2019 · Mirza Galib Anwarul Husain Baig, Deepanjan Kesh · Theoretical Computer Science
PDF
A Two Query Adaptive Bitprobe Scheme Storing Five Elements
2018 · Baig, Mirza Galib Anwarul Husain, Kesh, Deepanjan, et al. · arXiv (Cornell University)
PDF
A Divide and Conquer Method to Compute Binomial Ideals
2014 · Deepanjan Kesh, Shashank K. Mehta · Lecture notes in computer science
A saturation algorithm for homogeneous binomial ideals
2011 · Deepanjan Kesh, Shashank K. Mehta · ACM communications in computer algebra
Generalized Reduction to Compute Toric Ideals
2010 · DEEPANJAN KESH, SHASHANK K. MEHTA · Discrete Mathematics Algorithms and Applications
Works count: 22
Citation count: 175
H-index: 5
I10-index: 3
Year
Topic
Type