Folgen
Aleksandrs Belovs
Aleksandrs Belovs
assistant professor, University of Latvia
Bestätigte E-Mail-Adresse bei inbox.lv - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Span programs for functions with constant-sized 1-certificates
A Belovs
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
892012
Learning-graph-based Quantum Algorithm for k-distinctness
A Belovs
arXiv preprint arXiv:1205.1534, 2012
832012
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
752017
A polynomial lower bound for testing monotonicity
A Belovs, E Blais
SIAM Journal on Computing 50 (3), STOC16-406-STOC16-433, 2021
64*2021
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
A Belovs, BW Reichardt
Algorithms–ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia …, 2012
512012
Time-efficient quantum walks for 3-distinctness
A Belovs, AM Childs, S Jeffery, R Kothari, F Magniez
Automata, Languages, and Programming: 40th International Colloquium, ICALP …, 2013
492013
Adversary lower bound for the k-sum problem
A Belovs, R Spalek
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
462013
Quantum walks and electric networks
A Belovs
arXiv preprint arXiv:1302.3143, 2013
352013
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
332016
On the power of non-adaptive learning graphs
A Belovs, A Rosmanis
computational complexity 23, 323-354, 2014
312014
Multi-letter reversible and quantum finite automata
A Belovs, A Rosmanis, J Smotrovs
Developments in Language Theory: 11th International Conference, DLT 2007 …, 2007
302007
Quantum algorithms for learning symmetric juntas via the adversary bound
A Belovs
computational complexity 24, 255-293, 2015
292015
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
23*2017
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
232016
Quantum Algorithm for k-distinctness with Prior Knowledge on the Input
A Belovs, T Lee
Arxiv preprint arXiv:1108.3022, 2011
222011
Adaptive lower bound for testing monotonicity on the line
A Belovs
arXiv preprint arXiv:1801.08709, 2018
192018
Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness
C Cade, A Montanaro, A Belovs
arXiv preprint arXiv:1610.00581, 2016
182016
Variations on quantum adversary
A Belovs
arXiv preprint arXiv:1504.06943, 2015
182015
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
172017
Quantum algorithm for monotonicity testing on the hypercube
A Belovs, E Blais
arXiv preprint arXiv:1503.02868, 2015
172015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20