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.

 

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

Size of Quantum Versus Deterministic Finite Automata., , , , , , , , , и . VLSI, стр. 303-308. CSREA Press, (2003)A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases., и . MMICS, том 5393 из Lecture Notes in Computer Science, стр. 50-69. Springer, (2008)On the Power of Non-adaptive Learning Graphs., и . CCC, стр. 44-55. IEEE Computer Society, (2013)Adversary lower bounds for the collision and the set equality problems., и . Quantum Inf. Comput., 18 (3&4): 200-224 (2018)Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound.. CCC, стр. 22-31. IEEE Computer Society, (2014)Adversary Lower Bound for the k-sum Problem, и . CoRR, (2012)Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing., , , и . SODA, стр. 903-922. SIAM, (2016)Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection., и . ESA, том 7501 из Lecture Notes in Computer Science, стр. 193-204. Springer, (2012)Provably Secure Key Establishment Against Quantum Adversaries., , , , , и . TQC, том 73 из LIPIcs, стр. 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Span-program-based quantum algorithm for the rank problem. CoRR, (2011)