| 2025 | ICALP | On the Quantum Time Complexity of Divide and Conquer. | Jonathan Allcock, Jinge Bao, Aleksandrs Belovs, Troy Lee, Miklos Santha |
| 2024 | MFCS | Quantum Algorithms for Hopcroft's Problem. | Vladimirs Andrejevs, Aleksandrs Belovs, Jevgenijs Vihrovs |
| 2020 | SODA | Testing convexity of functions over finite domains. | Aleksandrs Belovs, Eric Blais, Abhinav Bommireddi |
| 2019 | CSR | Quantum Algorithm for Distribution-Free Junta Testing. | Aleksandrs Belovs |
| 2019 | ESA | Quantum Algorithms for Classical Probability Distributions. | Aleksandrs Belovs |
| 2019 | UC | Quantum Dual Adversary for Hidden Subgroups and Beyond. | Aleksandrs Belovs |
| 2016 | FOCS | Separations in Communication Complexity Using Cheat Sheets and Information Complexity. | Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Gs, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha |
| 2016 | SODA | Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing. | Andris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf |
| 2016 | STOC | Separations in query complexity based on pointer functions. | Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs |
| 2016 | STOC | A polynomial lower bound for testing monotonicity. | Aleksandrs Belovs, Eric Blais |
| 2013 | ICALP | Time-Efficient Quantum Walks for 3-Distinctness. | Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frdric Magniez |
| 2012 | ESA | Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection. | Aleksandrs Belovs, Ben W. Reichardt |
| 2012 | FOCS | Learning-Graph-Based Quantum Algorithm for k-Distinctness. | Aleksandrs Belovs |
| 2012 | STOC | Span programs for functions with constant-sized 1-certificates: extended abstract. | Aleksandrs Belovs |
| 2007 | DLT | Multi-letter Reversible and Quantum Finite Automata. | Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs |
| 2006 | SOFSEM | Non-intersecting Complexity. | Aleksandrs Belovs |