| 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 | 91 | 2019 |
| 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 | 91 | 2017 |
| Fasttext-based intent detection for inflected languages K Balodis, D Deksne Information 10 (5), 161, 2019 | 26 | 2019 |
| 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 | 24 | 2020 |
| 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 | 20 | 2012 |
| Intent detection problem solving via automatic DNN hyperparameter optimization J Kapočiūtė-Dzikienė, K Balodis, R Skadiņš Applied Sciences 10 (21), 7426, 2020 | 16 | 2020 |
| Unambiguous DNFs and Alon–Saks–Seymour K Balodis, S Ben-David, M Göös, S Jain, R Kothari SIAM Journal on Computing, FOCS21-157-FOCS21-173, 2023 | 13 | 2023 |
| 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, ... Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012 | 12 | 2012 |
| Intent detection system based on word embeddings K Balodis, D Deksne Artificial Intelligence: Methodology, Systems, and Applications: 18th …, 2018 | 11 | 2018 |
| 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 |
| Counting with probabilistic and ultrametric finite automata K Balodis Computing with New Resources: Essays Dedicated to Jozef Gruska on the …, 2014 | 7 | 2014 |
| Ultrametric Turing machines with limited reversal complexity R Krišlauks, I Rukšane, K Balodis, I Kucevalovs, R Freivalds, I Nagele Proceedings of SOFSEM 2, 87-94, 2013 | 7 | 2013 |
| 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 |
| Frequency prediction of functions K Balodis, I Kucevalovs, R Freivalds International Doctoral Workshop on Mathematical and Engineering Methods in …, 2011 | 5 | 2011 |
| Corpus Based Analysis for Multilingual Terminology Entry Compounding. A Vasiljevs, K Balodis LREC, 2010 | 5 | 2010 |
| Weak parity S Aaronson, A Ambainis, K Balodis, M Bavarian International Colloquium on Automata, Languages, and Programming, 26-38, 2014 | 4 | 2014 |
| One alternation can be more powerful than randomization in small and fast two-way finite automata K Balodis Fundamentals of Computation Theory: 19th International Symposium, FCT 2013 …, 2013 | 4 | 2013 |
| 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 | 3 | 2023 |
| Ultrametric query algorithms K Jerinš, K Balodis, R Krišlauks, K Cıpola, R Freivalds Proceedings of SOFSEM 2, 87-94, 2014 | 3 | 2014 |
| Worst case analysis of non-local games A Ambainis, A Bačkurs, K Balodis, A Škuškovniks, J Smotrovs, M Virza SOFSEM 2013: Theory and Practice of Computer Science: 39th International …, 2013 | 3 | 2013 |
Andris AmbainisProfessor, University of Latvia在 lu.lv 的电子邮件经过验证
