( en | de | ru )

 

Disambiguation of "Belovs, Aleksandrs"

Author of the publication

copydeleteadd this publication to your clipboard
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection.

, and . ESA, volume 7501 of Lecture Notes in Computer Science, page 193-204. Springer, (2012)

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.

Aleksandrs Ecins

 

Other publications of authors with the same name

Size of Quantum Versus Deterministic Finite Automata., , , , , , , , , and . VLSI, page 303-308. CSREA Press, (2003)A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases., and . MMICS, volume 5393 of Lecture Notes in Computer Science, page 50-69. Springer, (2008)On the Power of Non-adaptive Learning Graphs., and . CCC, page 44-55. IEEE Computer Society, (2013)On the Power of Non-Adaptive Learning Graphs. CoRR, (2012)Quantum Dual Adversary for Hidden Subgroups and Beyond.. UCNC, volume 11493 of Lecture Notes in Computer Science, page 30-36. Springer, (2019)Multi-letter Reversible and Quantum Finite Automata., , and . Developments in Language Theory, volume 4588 of Lecture Notes in Computer Science, page 60-71. Springer, (2007)Quantum Algorithms for Classical Probability Distributions.. ESA, volume 144 of LIPIcs, page 16:1-16:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems., and . TQC, volume 111 of LIPIcs, page 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Span programs for functions with constant-sized 1-certificates: extended abstract.. STOC, page 77-84. ACM, (2012)Adversary lower bound for the k-sum problem., and . ITCS, page 323-328. ACM, (2013)