Deepanjan Kesh

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