| 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 | 56 | 2017 |
| Multi-letter reversible and quantum finite automata A Belovs, A Rosmanis, J Smotrovs International Conference on Developments in Language Theory, 60-71, 2007 | 25 | 2007 |
| Exact quantum query complexity of EXACT and THRESHOLD A Ambainis, J Iraids, J Smotrovs arXiv preprint arXiv:1302.1235, 2013 | 20 | 2013 |
| Polynomials, quantum query complexity, and Grothendieck's inequality S Aaronson, A Ambainis, J Iraids, M Kokainis, J Smotrovs arXiv preprint arXiv:1511.08682, 2015 | 18 | 2015 |
| Unions of identifiable classes of total recursive functions K Apsītis, R Freivalds, M Krikis, R Simanovskis, J Smotrovs International Workshop on Analogical and Inductive Inference, 99-107, 1992 | 14 | 1992 |
| Quantum strategies are better than classical in almost any XOR game A Ambainis, A Bačkurs, K Balodis, D Kravčenko, R Ozols, J Smotrovs, ... International Colloquium on Automata, Languages, and Programming, 25-37, 2012 | 12 | 2012 |
| A criterion for attaining the Welch bounds with applications for mutually unbiased bases A Belovs, J Smotrovs Mathematical Methods in Computer Science, 50-69, 2008 | 12 | 2008 |
| Quantum strategies are better than classical in almost any XOR game A Ambainis, A Bačkurs, K Balodis, D Kravčenko, R Ozols, J Smotrovs, ... International Colloquium on Automata, Languages, and Programming, 25-37, 2012 | 11 | 2012 |
| Optimal quantum query bounds for almost all Boolean functions A Ambainis, A Backurs, J Smotrovs, R de Wolf arXiv preprint arXiv:1208.1122, 2012 | 8 | 2012 |
| Effects of Kolmogorov complexity present in inductive inference as well A Ambainis, K Apsītis, C Calude, R Freivalds, M Karpinski, T Larfeldt, ... International Workshop on Algorithmic Learning Theory, 244-259, 1997 | 7 | 1997 |
| Parameterized quantum query complexity of graph collision A Ambainis, K Balodis, J Iraids, R Ozols, J Smotrovs arXiv preprint arXiv:1305.1021, 2013 | 6 | 2013 |
| Closedness properties in ex-identification K Apsıtis, R Freivalds, R Simanovskis, J Smotrovs Theoretical computer science 268 (2), 367-393, 2001 | 5 | 2001 |
| Unions of identifiable families of languages K Apsītis, R Freivalds, R Simanovskis, J Smotrovs International Colloquium on Grammatical Inference, 48-58, 1996 | 4 | 1996 |
| Enumerable classes of total recursive functions: Complexity of inductive inference A Ambainis, J Smotrovs Algorithmic Learning Theory, 10-25, 1994 | 4 | 1994 |
| Worst case analysis of non-local games A Ambainis, A Bačkurs, K Balodis, A Škuškovniks, J Smotrovs, M Virza International Conference on Current Trends in Theory and Practice of …, 2013 | 3 | 2013 |
| Closedness properties in team learning of recursive functions J Smotrovs European Conference on Computational Learning Theory, 79-93, 1997 | 2 | 1997 |
| Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language A Ambainis, K Balodis, J Iraids, K Khadiev, V Kļevickis, K Prūsis, Y Shen, ... arXiv preprint arXiv:2007.03402, 2020 | 1 | 2020 |
| Quantum Lower Bounds for 2D-Grid and Dyck Language A Ambainis, K Balodis, J Iraids, K Prūsis, J Smotrovs arXiv preprint arXiv:1911.12638, 2019 | | 2019 |
| Worst Case Analysis of Non-local Games⋆ J Smotrovs, M Virza SOFSEM 2013: Theory and Practice of Computer Science: 39th International …, 2013 | | 2013 |
| Closedness properties in inductive inference J Smotrovs | | 1999 |
Andris AmbainisProfessor, University of LatviaVerified email at lu.lv
