default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDeepanjan Kesh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Mirza Galib Anwarul Husain Baig
, Deepanjan Kesh, Chirag Sodani:
Storing four elements in the two query bitprobe model. Discret. Appl. Math. 319: 121-131 (2022)- [j5]Deepanjan Kesh, Vidya Sagar Sharma:
On the bitprobe complexity of two probe adaptive schemes. Discret. Appl. Math. 319: 132-140 (2022) - [c14]Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal:
Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model. IWOCA 2022: 31-45 - [i4]Sreshth Aggarwal, Deepanjan Kesh, Divyam Singal:
Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model. CoRR abs/2204.03266 (2022) - 2020
- [j4]Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Two improved schemes in the bitprobe model. Theor. Comput. Sci. 806: 543-552 (2020) - [j3]Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Improved bounds for two query adaptive bitprobe schemes storing five elements. Theor. Comput. Sci. 838: 208-230 (2020)
2010 – 2019
- 2019
- [c13]Deepanjan Kesh, Vidya Sagar Sharma:
On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements. CALDAM 2019: 53-64 - [c12]Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. COCOA 2019: 13-25 - [c11]Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
An Improved Scheme in the Two Query Adaptive Bitprobe Model. IWOCA 2019: 22-34 - [c10]Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
A Two Query Adaptive Bitprobe Scheme Storing Five Elements. WALCOM 2019: 317-328 - [i3]Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements. CoRR abs/1910.03651 (2019) - 2018
- [c9]Deepanjan Kesh:
Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements. FSTTCS 2018: 12:1-12:12 - [c8]Mirza Galib Anwarul Husain Baig, Deepanjan Kesh:
Two New Schemes in the Bitprobe Model. WALCOM 2018: 68-79 - [i2]Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
A Two Query Adaptive Bitprobe Scheme Storing Five Elements. CoRR abs/1810.13331 (2018) - [i1]Mirza Galib Anwarul Husain Baig, Deepanjan Kesh, Chirag Sodani:
An Improved Scheme in the Two Query Adaptive Bitprobe Model. CoRR abs/1812.04802 (2018) - 2017
- [c7]Deepanjan Kesh:
On Adaptive Bitprobe Schemes for Storing Two Elements. COCOA (1) 2017: 471-479 - 2014
- [c6]Deepanjan Kesh, Shashank K. Mehta:
A Divide and Conquer Method to Compute Binomial Ideals. LATIN 2014: 648-659 - 2011
- [j2]Deepanjan Kesh, Shashank K. Mehta:
A saturation algorithm for homogeneous binomial ideals. ACM Commun. Comput. Algebra 45(1/2): 121-122 (2011) - [c5]Deepanjan Kesh, Shashank K. Mehta:
A Saturation Algorithm for Homogeneous Binomial Ideals. COCOA 2011: 357-371 - 2010
- [j1]Deepanjan Kesh, Shashank K. Mehta:
Generalized Reduction to Compute toric ideals. Discret. Math. Algorithms Appl. 2(1): 45-60 (2010)
2000 – 2009
- 2009
- [c4]Deepanjan Kesh, Shashank K. Mehta:
Generalized Reduction to Compute Toric Ideals. ISAAC 2009: 483-492 - 2008
- [c3]Deepanjan Kesh, Shashank K. Mehta:
Polynomial irreducibility testing through Minkowski summand computation. CCCG 2008 - 2006
- [c2]Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, Chandan Saha:
Simpler algorithm for estimating frequency moments of data streams. SODA 2006: 708-713 - 2005
- [c1]Sumit Ganguly, Deepanjan Kesh, Chandan Saha:
Practical Algorithms for Tracking Database Join Sizes. FSTTCS 2005: 297-309
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
