Deepanjan Kesh · VLDB 2026 Research

VLDB 2026 Research / reviewers in the wild / expert

Deepanjan Kesh

dblp:52/25 · DBLP profile ↗

← Back

16ranked-venue papers

6as first author

3since 2021 · last 2022

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 13 · 4 first-author · 3 since 2021Artificial intelligence and machine learning · 3 · 2 first-author

Year	Publication	Venue	Position
2022	Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal	IWOCA	2
2022	Storing four elements in the two query bitprobe model Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani	Discret. Appl. Math.	2
2022	On the bitprobe complexity of two probe adaptive schemes Deepanjan Kesh, Vidya Sagar Sharma	Discret. Appl. Math.	1
2020	Two improved schemes in the bitprobe model Mirza Galib Anwarul Husain Baig, Deepanjan Kesh	Theor. Comput. Sci.	2
2020	Improved bounds for two query adaptive bitprobe schemes storing five elements Mirza Galib Anwarul Husain Baig, Deepanjan Kesh	Theor. Comput. Sci.	2
2019	Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements Mirza Galib Anwarul Husain Baig, Deepanjan Kesh	COCOA	2
2019	An Improved Scheme in the Two Query Adaptive Bitprobe Model Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani	IWOCA	2
2019	A Two Query Adaptive Bitprobe Scheme Storing Five Elements Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani	WALCOM	2
2018	Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements abstract We consider the following set membership problem in the bitprobe model - that of storing subsets of size at most three from a universe of size m, and answering membership queries using two adaptive bitprobes. Baig and Kesh [Mirza Galib Anwarul Husain Baig and Deepanjan Kesh, 2018] proposed a scheme for the problem which takes O(m^{2/3}) space. In this paper, we present a proof which shows that any scheme for the problem requires Omega(m^{2/3}) amount of space. These two results together settle the space complexity issue for this particular problem. Deepanjan Kesh	FSTTCS	1
2018	Two New Schemes in the Bitprobe Model Mirza Galib Anwarul Husain Baig, Deepanjan Kesh	WALCOM	2
2017	On Adaptive Bitprobe Schemes for Storing Two Elements Deepanjan Kesh	COCOA (1)	1
2014	A Divide and Conquer Method to Compute Binomial Ideals Deepanjan Kesh, Shashank K. Mehta	LATIN	1
2011	A Saturation Algorithm for Homogeneous Binomial Ideals Deepanjan Kesh, Shashank K. Mehta	COCOA	1
2009	Generalized Reduction to Compute Toric Ideals Deepanjan Kesh, Shashank K. Mehta	ISAAC	1
2006	Simpler algorithm for estimating frequency moments of data streams Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, Chandan Saha 0001	SODA	3
2005	Practical Algorithms for Tracking Database Join Sizes Sumit Ganguly, Deepanjan Kesh, Chandan Saha 0001	FSTTCS	2