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 | 50 | 2017 |

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 | 15 | 2012 |

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 | 12 | 2019 |

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 |

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 | 9 | 2012 |

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 |

Corpus Based Analysis for Multilingual Terminology Entry Compounding. A Vasiljevs, K Balodis LREC, 2010 | 6 | 2010 |

Intent detection system based on word embeddings K Balodis, D Deksne International Conference on Artificial Intelligence: Methodology, Systems …, 2018 | 5 | 2018 |

Counting with probabilistic and ultrametric finite automata K Balodis Computing with New Resources, 3-16, 2014 | 5 | 2014 |

One alternation can be more powerful than randomization in small and fast two-way finite automata K Balodis International Symposium on Fundamentals of Computation Theory, 40-47, 2013 | 5 | 2013 |

Parameterized quantum query complexity of graph collision A Ambainis, K Balodis, J Iraids, R Ozols, J Smotrovs arXiv preprint arXiv:1305.1021, 2013 | 5 | 2013 |

Frequency prediction of functions K Balodis, I Kucevalovs, R Freivalds International Doctoral Workshop on Mathematical and Engineering Methods in …, 2011 | 5 | 2011 |

Weak parity S Aaronson, A Ambainis, K Balodis, M Bavarian International Colloquium on Automata, Languages, and Programming, 26-38, 2014 | 3 | 2014 |

Ultrametric query algorithms K Jerinš, K Balodis, R Krišlauks, K Cıpola, R Freivalds Proceedings of SOFSEM 2, 87-94, 2014 | 3 | 2014 |

Structured Frequency Algorithms K Balodis, J Iraids, R Freivalds International Conference on Theory and Applications of Models of Computation …, 2015 | 2 | 2015 |

On the Hierarchy Classes of Finite Ultrametric Automata R Krišlauks, K Balodis International Conference on Current Trends in Theory and Practice of …, 2015 | 2 | 2015 |

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 | 2 | 2013 |

FastText-Based Intent Detection for Inflected Languages K Balodis, D Deksne Information 10 (5), 161, 2019 | 1 | 2019 |

Quantum strategies are better than classical in almost any XOR game A Ambainis, A Backurs, K Balodis, D Kravcenko, R Ozols, J Smotrovs, ... arXiv preprint arXiv:1112.3330, 2011 | 1 | 2011 |

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 |