( en | de | ru )

 

Disambiguation of "Kesh, Deepanjan"

Author of the publication

copydeleteadd this publication to your clipboard
A saturation algorithm for homogeneous binomial ideals.

, and . ACM Commun. Comput. Algebra, 45 (1/2): 121-122 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Salahedeen Keshlaf

Shafique Keshavjee

Mohammad Keshtgari

S. R. Keshava

Hengameh Keshavarz

 

Other publications of authors with the same name

Two New Schemes in the Bitprobe Model., and . WALCOM, volume 10755 of Lecture Notes in Computer Science, page 68-79. Springer, (2018)Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements., and . COCOA, volume 11949 of Lecture Notes in Computer Science, page 13-25. Springer, (2019)An Improved Scheme in the Two Query Adaptive Bitprobe Model., , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 22-34. Springer, (2019)Generalized Reduction to Compute Toric Ideals., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 483-492. Springer, (2009)A Divide and Conquer Method to Compute Binomial Ideals., and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 648-659. Springer, (2014)A saturation algorithm for homogeneous binomial ideals., and . ACM Commun. Comput. Algebra, 45 (1/2): 121-122 (2011)An Improved Scheme in the Two Query Adaptive Bitprobe Model., , and . CoRR, (2018)A Two Query Adaptive Bitprobe Scheme Storing Five Elements., , and . CoRR, (2018)Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements.. FSTTCS, volume 122 of LIPIcs, page 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Storing four elements in the two query bitprobe model., , and . Discret. Appl. Math., (2022)