Corpus Based Analysis for Multilingual Terminology Entry Compounding. - Andrejs Vasiljevs; Kaspars Balodis (LREC, 2010)

Frequency Prediction of Functions. - Kaspars Balodis; Ilja Kucevalovs; Rusins Freivalds (MEMICS, 2011)

Quantum strategies are better than classical in almost any XOR game - Andris Ambainis; Arturs Backurs; Kaspars Balodis; Dmitry Kravchenko; Raitis Ozols; Juris Smotrovs; Madars Virza (CoRR, 2011)

Quantum Strategies Are Better Than Classical in Almost Any XOR Game. - Andris Ambainis; Arturs Backurs; Kaspars Balodis; Dmitrijs Kravcenko; Raitis Ozols; Juris Smotrovs; Madars Virza (ICALP (1), 2012)

One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata. - Kaspars Balodis (FCT, 2013)

Worst Case Analysis of Non-local Games. - Andris Ambainis; Arturs Backurs; Kaspars Balodis; Agnis Skuskovniks; Juris Smotrovs; Madars Virza (SOFSEM, 2013)

Parameterized Quantum Query Complexity of Graph Collision - Andris Ambainis; Kaspars Balodis; Janis Iraids; Raitis Ozols; Juris Smotrovs (CoRR, 2013)

Weak Parity. - Scott Aaronson; Andris Ambainis; Kaspars Balodis; Mohammad Bavarian (Electron. Colloquium Comput. Complex., 2013)

Counting with Probabilistic and Ultrametric Finite Automata. - Kaspars Balodis (Computing with New Resources, 2014)

On the Hierarchy Classes of Finite Ultrametric Automata. - Rihards Krislauks; Kaspars Balodis (SOFSEM, 2015)

Structured Frequency Algorithms. - Kaspars Balodis; Janis Iraids; Rusins Freivalds (TAMC, 2015)

Separations in Query Complexity Based on Pointer Functions. - Andris Ambainis; Kaspars Balodis; Aleksandrs Belovs; Troy Lee; Miklos Santha; Juris Smotrovs (Electron. Colloquium Comput. Complex., 2015)

Two-way frequency finite automata. - Kaspars Balodis; Maksims Dimitrijevs; Abuzer Yakaryilmaz (NCMA, 2016)

Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection. - Kaspars Balodis; Janis Iraids (Balt. J. Mod. Comput., 2016)

Intent Detection System Based on Word Embeddings. - Kaspars Balodis; Daiga Deksne (AIMSA, 2018)

Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Martins Kokainis; Krisjanis Prusis; Jevgenijs Vihrovs (SODA, 2019)

Quantum Lower Bounds for 2D-Grid and Dyck Language. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Krisjanis Prusis; Juris Smotrovs (CoRR, 2019)

FastText-Based Intent Detection for Inflected Languages. - Kaspars Balodis; Daiga Deksne (Inf., 2019)

Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Kamil Khadiev; Vladislavs Klevickis; Krisjanis Prusis; Yixin Shen 001; Juris Smotrovs; Jevgenijs Vihrovs (MFCS, 2020)

Unambiguous DNFs and Alon-Saks-Seymour. - Kaspars Balodis; Shalev Ben-David; Mika Göös; Siddhartha Jain 002; Robin Kothari (FOCS, 2021)

A Note About Claw Function with a Small Range. - Andris Ambainis; Kaspars Balodis; Janis Iraids (TQC, 2021)

Several Separations Based on a Partial Boolean Function. - Kaspars Balodis (CoRR, 2021)

Quantum bounds for 2D-grid and Dyck language. - Andris Ambainis; Kaspars Balodis; Janis Iraids; Kamil Khadiev; Vladislavs Klevickis; Krisjanis Prusis; Yixin Shen 001; Juris Smotrovs; Jevgenijs Vihrovs (Quantum Inf. Process., 2023)