From post

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.

 

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

Quantum Ciphertext Authentication and Key Recycling with the Trap Code., и . TQC, том 111 из LIPIcs, стр. 1:1-1:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Round Elimination in Exact Communication Complexity., , , , и . TQC, том 44 из LIPIcs, стр. 206-225. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Fully Characterizing Lossy Catalytic Computation., , , и . CoRR, (2024)Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks., , , и . CoRR, (2021)Oblivious Transfer from Zero-Knowledge Proofs - Or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States., , и . ASIACRYPT (8), том 14445 из Lecture Notes in Computer Science, стр. 3-38. Springer, (2023)A Guide for New Program Committee Members at Theoretical Computer Science Conferences., , , , , и . CoRR, (2021)Computing with a full memory: catalytic space., , , , и . STOC, стр. 857-866. ACM, (2014)Catalytic Space: Non-determinism and Hierarchy., , , и . STACS, том 47 из LIPIcs, стр. 24:1-24:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks., , , и . ITCS, том 215 из LIPIcs, стр. 31:1-31:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Toward Complete Quantum Network Stacks: A Survey., , , и . IEEE Netw., 38 (5): 153-159 (сентября 2024)