( en | de | ru )

 

Disambiguation of "Prūsis, Krišjānis"

Author of the publication

copydeleteadd this publication to your clipboard
Doubling the Success of Quantum Walk Search Using Internal-State Measurements

, , and . J. Phys. A: Math. Theor. 49, 455301, (2016)

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.

No persons found for author name Prūsis, Krišjānis
add a person with the name Prūsis, Krišjānis
 

Other publications of authors with the same name

Doubling the Success of Quantum Walk Search Using Internal-State Measurements, , and . J. Phys. A: Math. Theor. 49, 455301, (2016)Stationary States in Quantum Walk Search, , and . Phys. Rev. A 94, 032334, (2016)All Classical Adversary Methods are Equivalent for Total Functions., , , and . STACS, volume 96 of LIPIcs, page 8:1-8:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)All Classical Adversary Methods Are Equivalent for Total Functions., , , , and . ACM Trans. Comput. Theory, 13 (1): 7:1-7:20 (2021)A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity., and . Electron. Colloquium Comput. Complex., (2014)Sensitivity versus Certificate Complexity of Boolean Functions., , and . CoRR, (2015)All Classical Adversary Methods are Equivalent for Total Functions., , , and . CoRR, (2017)Sensitivity Versus Certificate Complexity of Boolean Functions., , and . CSR, volume 9691 of Lecture Notes in Computer Science, page 16-28. Springer, (2016)A Potential Field Function for Overlapping Point Set and Graph Cluster Visualization., , , , and . VISIGRAPP (Selected Papers), volume 550 of Communications in Computer and Information Science, page 136-152. Springer, (2014)Quantum Speedups for Exponential-Time Dynamic Programming Algorithms., , , , , and . SODA, page 1783-1793. SIAM, (2019)