( en | de | ru )

 

Disambiguation of "Kundu, Srijita"

Author of the publication

copydeleteadd this publication to your clipboard
Oracle Separation of QMA and QCMA with Bounded Adaptivity.

, and . ICALP, volume 297 of LIPIcs, page 21:1-21:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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.

Arijit Kundu

Sudip Kundu

Shankhamala Kundu

Sudipta Kundu

Swarupa Kundu-Michalik

 

Other publications of authors with the same name

On the Hardness of the Minimum Distance Problem of Quantum Codes., and . IEEE Trans. Inf. Theory, 69 (10): 6293-6302 (October 2023)A direct product theorem for quantum communication complexity with applications to device-independent QKD., and . FOCS, page 1285-1295. IEEE, (2021)On the Power of Quantum Distributed Proofs., , and . PODC, page 220-230. ACM, (2024)On Query-to-Communication Lifting for Adversary Bounds., , and . CoRR, (2020)Rhythmus periodic frequent pattern mining without periodicity threshold., , , , and . J. Ambient Intell. Humaniz. Comput., 14 (7): 8551-8563 (July 2023)A Direct Product Theorem for One-Way Quantum Communication., and . CCC, volume 200 of LIPIcs, page 27:1-27:28. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions., , , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 275-289. Springer, (2018)On Query-To-Communication Lifting for Adversary Bounds., , and . CCC, volume 200 of LIPIcs, page 30:1-30:39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A Composition Theorem for Randomized Query Complexity., , , , , , , and . FSTTCS, volume 93 of LIPIcs, page 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)