Aleksandrs Belovs
Aleksandrs Belovs
assistant professor, University of Latvia
Verifierad e-postadress på - Startsida
Citeras av
Citeras av
Span programs for functions with constant-sized 1-certificates
A Belovs
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
Learning-graph-based Quantum Algorithm for k-distinctness
A Belovs
arXiv preprint arXiv:1205.1534, 2012
Separations in query complexity based on pointer functions
A Ambainis, K Balodis, A Belovs, T Lee, M Santha, J Smotrovs
Journal of the ACM (JACM) 64 (5), 1-24, 2017
A polynomial lower bound for testing monotonicity
A Belovs, E Blais
SIAM Journal on Computing, STOC16-406-STOC16-433, 2021
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
A Belovs, BW Reichardt
European Symposium on Algorithms, 193-204, 2012
Time-efficient quantum walks for 3-distinctness
A Belovs, AM Childs, S Jeffery, R Kothari, F Magniez
International Colloquium on Automata, Languages, and Programming, 105-122, 2013
Adversary lower bound for the k-sum problem
A Belovs, R Spalek
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
On the power of non-adaptive learning graphs
A Belovs, A Rosmanis
computational complexity 23 (2), 323-354, 2014
Multi-letter reversible and quantum finite automata
A Belovs, A Rosmanis, J Smotrovs
International Conference on Developments in Language Theory, 60-71, 2007
Quantum walks and electric networks
A Belovs
arXiv preprint arXiv:1302.3143, 2013
Efficient quantum algorithms for (gapped) group testing and junta testing
A Ambainis, A Belovs, O Regev, R Wolf
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
Quantum algorithms for learning symmetric juntas via the adversary bound
A Belovs
computational complexity 24 (2), 255-293, 2015
Quantum Algorithm for k-distinctness with Prior Knowledge on the Input
A Belovs, T Lee
Arxiv preprint arXiv:1108.3022, 2011
Separations in communication complexity using cheat sheets and information complexity
A Anshu, A Belovs, S Ben-David, M Göös, R Jain, R Kothari, T Lee, ...
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
On a conjecture by Christian Choffrut
A Belovs, JA Montoya, A Yakaryılmaz
International Journal of Foundations of Computer Science 28 (05), 483-501, 2017
Some algebraic properties of machine poset of infinite words
A Belovs
RAIRO-Theoretical Informatics and Applications 42 (3), 451-466, 2008
On the polynomial parity argument complexity of the combinatorial nullstellensatz
A Belovs, G Ivanyos, Y Qiao, M Santha, S Yang
arXiv preprint arXiv:1710.08602, 2017
Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness
C Cade, A Montanaro, A Belovs
arXiv preprint arXiv:1610.00581, 2016
Quantum algorithm for monotonicity testing on the hypercube
A Belovs, E Blais
arXiv preprint arXiv:1503.02868, 2015
Span-program-based quantum algorithm for the rank problem
A Belovs
arXiv preprint arXiv:1103.0842, 2011
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20