Kaspars Balodis

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 17

Top Topics

Query Complexity

Finite Automata

Dynamic Programming Algorithms

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs
Quantum bounds for 2D-grid and Dyck language. Quantum Inf. Process. 22 (5) (2023)
Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari
Unambiguous DNFs and Alon-Saks-Seymour. FOCS (2022)
Andris Ambainis, Kaspars Balodis, Janis Iraids
A note about claw function with a small range. CoRR (2021)
Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari
Unambiguous DNFs and Alon-Saks-Seymour. FOCS (2021)
Kaspars Balodis
Several Separations Based on a Partial Boolean Function. CoRR (2021)
Andris Ambainis, Kaspars Balodis, Janis Iraids
A Note About Claw Function with a Small Range. TQC (2021)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. CoRR (2020)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. MFCS (2020)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. SODA (2019)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Krisjanis Prusis, Juris Smotrovs
Quantum Lower Bounds for 2D-Grid and Dyck Language. CoRR (2019)
Kaspars Balodis, Daiga Deksne
FastText-Based Intent Detection for Inflected Languages. Inf. 10 (5) (2019)
Kaspars Balodis, Daiga Deksne
Intent Detection System Based on Word Embeddings. AIMSA (2018)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. CoRR (2018)
Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs
Separations in Query Complexity Based on Pointer Functions. J. ACM 64 (5) (2017)
Kaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz
Two-way frequency finite automata. NCMA (2016)
Kaspars Balodis, Janis Iraids
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection. Balt. J. Mod. Comput. 4 (4) (2016)
Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs
Separations in query complexity based on pointer functions. STOC (2016)
Kaspars Balodis, Janis Iraids, Rusins Freivalds
Structured Frequency Algorithms. TAMC (2015)
Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs
Separations in Query Complexity Based on Pointer Functions. Electron. Colloquium Comput. Complex. 22 (2015)
Rihards Krislauks, Kaspars Balodis
On the Hierarchy Classes of Finite Ultrametric Automata. SOFSEM (2015)
Kaspars Balodis, Janis Iraids
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection. CoRR (2015)
Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs
Separations in Query Complexity Based on Pointer Functions. CoRR (2015)
Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian
Weak Parity. ICALP (1) (2014)
Kaspars Balodis
Counting with Probabilistic and Ultrametric Finite Automata. Computing with New Resources (2014)
Andris Ambainis, Kaspars Balodis, Janis Iraids, Raitis Ozols, Juris Smotrovs
Parameterized Quantum Query Complexity of Graph Collision CoRR (2013)
Kaspars Balodis
One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata. FCT (2013)
Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian
Weak Parity. CoRR (2013)
Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian
Weak Parity. Electron. Colloquium Comput. Complex. 20 (2013)
Andris Ambainis, Arturs Backurs, Kaspars Balodis, Agnis Skuskovniks, Juris Smotrovs, Madars Virza
Worst Case Analysis of Non-local Games. SOFSEM (2013)
Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitrijs Kravcenko, Raitis Ozols, Juris Smotrovs, Madars Virza
Quantum Strategies Are Better Than Classical in Almost Any XOR Game. ICALP (1) (2012)
Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitry Kravchenko, Raitis Ozols, Juris Smotrovs, Madars Virza
Quantum strategies are better than classical in almost any XOR game CoRR (2011)
Kaspars Balodis, Ilja Kucevalovs, Rusins Freivalds
Frequency Prediction of Functions. MEMICS (2011)
Andrejs Vasiljevs, Kaspars Balodis
Corpus Based Analysis for Multilingual Terminology Entry Compounding. LREC (2010)