| Quantum speedups for exponential-time dynamic programming algorithms A Ambainis, K Balodis, J Iraids, M Kokainis, K Prūsis, J Vihrovs Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 113 | 2019 |
| Polynomials, quantum query complexity, and Grothendieck's inequality S Aaronson, A Ambainis, J Iraids, M Kokainis, J Smotrovs arXiv preprint arXiv:1511.08682, 2015 | 33 | 2015 |
| 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 | 25 | 2020 |
| Exact quantum query complexity of EXACT and THRESHOLD A Ambainis, J Iraids, J Smotrovs arXiv preprint arXiv:1302.1235, 2013 | 25 | 2013 |
| Integer complexity: Experimental and analytical results J Iraids, K Balodis, J Čerņenoks, M Opmanis, R Opmanis, K Podnieks arXiv preprint arXiv:1203.6462, 2012 | 21 | 2012 |
| Exact Quantum Query Complexity of A Ambainis, J Iraids, D Nagaj International Conference on Current Trends in Theory and Practice of …, 2017 | 16 | 2017 |
| Tree based domain-specific mapping languages E Kalnina, A Kalnins, A Sostaks, E Celms, J Iraids SOFSEM 2012: Theory and Practice of Computer Science: 38th Conference on …, 2012 | 10 | 2012 |
| On the state complexity of ultrametric finite automata K Balodis, A Berina, K Cıpola, M Dimitrijevs, J Iraids, K Jerinš, V Kacs, ... Proceedings of SOFSEM 2, 1-9, 2013 | 9 | 2013 |
| 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013) H Shah, G Kuperberg, J Klassen, J Chen, B Zeng, AM Childs, R Kothari, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2013 | 9 | 2013 |
| Parameterized quantum query complexity of graph collision A Ambainis, K Balodis, J Iraids, R Ozols, J Smotrovs arXiv preprint arXiv:1305.1021, 2013 | 7 | 2013 |
| Advantage of quantum strategies in random symmetric XOR games A Ambainis, J Iraids, D Kravchenko, M Virza Mathematical and Engineering Methods in Computer Science: 8th International …, 2013 | 7 | 2013 |
| Integer complexity: Experimental and analytical results II J Čerņenoks, J Iraids, M Opmanis, R Opmanis, K Podnieks International Workshop on Descriptional Complexity of Formal Systems, 58-69, 2015 | 5 | 2015 |
| Quantum bounds for 2D-grid and Dyck language A Ambainis, K Balodis, J Iraids, K Khadiev, V Kļevickis, K Prūsis, Y Shen, ... Quantum Information Processing 22 (5), 194, 2023 | 4 | 2023 |
| provable advantage for quantum strategies in random symmetric XOR games A Ambainis, J Iraids arXiv preprint arXiv:1302.2347, 2013 | 4 | 2013 |
| Generation Mechanisms in Graphical Template Language. E Kalnina, A Kalnins, E Celms, A Sostaks, J Iraids MDA/MTDD, 43-52, 2010 | 4 | 2010 |
| Model migration with MOLA E Kalnina, A Kalnins, J Iraids, A Sostaks, E Celms Transformation Tool Contest 2010 1-2 July 2010, Malaga, Spain, 38, 2010 | 4 | 2010 |
| Saying hello world with MOLA-a solution to the TTC 2011 instructive case E Kalnina, A Kalnins, A Sostaks, J Iraids, E Celms arXiv preprint arXiv:1111.4755, 2011 | 3 | 2011 |
| 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) D Král, N Bertrand, S Cabello, M Wootters, D Ağaoğlu, P Hliněný, J Ahn, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | 2 | 2020 |
| Optimal one-shot quantum algorithm for EQUALITY and AND A Ambainis, J Iraids arXiv preprint arXiv:1701.06942, 2017 | 2 | 2017 |
| 31st Conference on Computational Complexity (CCC 2016) R Raz Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2016 | 2 | 2016 |
Andris AmbainisProfessor, University of LatviaVahvistettu sähköpostiosoite verkkotunnuksessa lu.lv
