( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Saturation Algorithm for Homogeneous Binomial Ideals.

, и . COCOA, том 6831 из Lecture Notes in Computer Science, стр. 357-371. Springer, (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.

Salahedeen Keshlaf

Shafique Keshavjee

Mohammad Keshtgari

S. R. Keshava

Hengameh Keshavarz

 

Другие публикации лиц с тем же именем

Two New Schemes in the Bitprobe Model., и . WALCOM, том 10755 из Lecture Notes in Computer Science, стр. 68-79. Springer, (2018)Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements., и . COCOA, том 11949 из Lecture Notes in Computer Science, стр. 13-25. Springer, (2019)An Improved Scheme in the Two Query Adaptive Bitprobe Model., , и . IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 22-34. Springer, (2019)Polynomial irreducibility testing through Minkowski summand computation., и . CCCG, (2008)On Adaptive Bitprobe Schemes for Storing Two Elements.. COCOA (1), том 10627 из Lecture Notes in Computer Science, стр. 471-479. Springer, (2017)A Two Query Adaptive Bitprobe Scheme Storing Five Elements., , и . CoRR, (2018)Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements.. FSTTCS, том 122 из LIPIcs, стр. 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements., и . CALDAM, том 11394 из Lecture Notes in Computer Science, стр. 53-64. Springer, (2019)A Two Query Adaptive Bitprobe Scheme Storing Five Elements., , и . WALCOM, том 11355 из Lecture Notes in Computer Science, стр. 317-328. Springer, (2019)Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model., , и . IWOCA, том 13270 из Lecture Notes in Computer Science, стр. 31-45. Springer, (2022)