Deepanjan Kesh

Available identifiers

Publication	Date of Publication	Type
Lower bounds for restricted schemes in the two-adaptive bitprobe model	2022-08-30	Paper
Storing four elements in the two query bitprobe model	2022-08-04	Paper
On the bitprobe complexity of two probe adaptive schemes	2022-08-04	Paper
Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements	2022-07-21	Paper
An improved scheme in the two query adaptive bitprobe model	2020-02-25	Paper
Two improved schemes in the bitprobe model	2020-01-16	Paper
A two query adaptive bitprobe scheme storing five elements	2019-10-15	Paper
On the bitprobe complexity of two probe adaptive schemes storing two elements	2019-10-10	Paper
Two new schemes in the bitprobe model	2018-06-15	Paper
On adaptive bitprobe schemes for storing two elements	2018-02-26	Paper
A saturation algorithm for homogeneous binomial ideals	2015-02-20	Paper
A divide and conquer method to compute binomial ideals	2014-03-31	Paper
A saturation algorithm for homogeneous binomial ideals	2011-08-12	Paper
Generalized reduction to compute toric ideals	2010-05-19	Paper
Generalized reduction to compute toric ideals	2009-12-17	Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science	2006-11-14	Paper

This page was built for person: Deepanjan Kesh