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.

 

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

Sensitivity versus Certificate Complexity of Boolean Functions., , и . CoRR, (2015)Size of Sets with Small Sensitivity: A Generalization of Simon's Lemma., и . TAMC, том 9076 из Lecture Notes in Computer Science, стр. 122-133. Springer, (2015)Stationary States in Quantum Walk Search, , и . Phys. Rev. A 94, 032334, (2016)On Block Sensitivity and Fractional Block Sensitivity., , и . CoRR, (2018)An Inverse Distance-based Potential Field Function for Overlapping Point Set Visualization., , , , и . IVAPP, стр. 29-38. SciTePress, (2014)Quadratically Tight Relations for Randomized Query Complexity., , , , , , и . Theory Comput. Syst., 64 (1): 101-119 (2020)All Classical Adversary Methods are Equivalent for Total Functions., , , и . STACS, том 96 из LIPIcs, стр. 8:1-8:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)All Classical Adversary Methods Are Equivalent for Total Functions., , , , и . ACM Trans. Comput. Theory, 13 (1): 7:1-7:20 (2021)Quantum bounds for 2D-grid and Dyck language., , , , , , , , и . Quantum Inf. Process., 22 (5): 194 (мая 2023)Doubling the Success of Quantum Walk Search Using Internal-State Measurements, , и . J. Phys. A: Math. Theor. 49, 455301, (2016)