Kaspars Balodis
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
12
Venues
10
Active years
2010–2021
Best venue rank
A*
Where they publish
Papers
12 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2021 | FOCS | Unambiguous DNFs and Alon-Saks-Seymour. | Kaspars Balodis, Shalev Ben-David, Mika Gs, Siddhartha Jain, Robin Kothari |
| 2020 | MFCS | 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, Juris Smotrovs, Jevgenijs Vihrovs |
| 2019 | SODA | Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. | Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs |
| 2018 | AIMSA | Intent Detection System Based on Word Embeddings. | Kaspars Balodis, Daiga Deksne |
| 2016 | STOC | Separations in query complexity based on pointer functions. | Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs |
| 2015 | SOFSEM | On the Hierarchy Classes of Finite Ultrametric Automata. | Rihards Krislauks, Kaspars Balodis |
| 2015 | TAMC | Structured Frequency Algorithms. | Kaspars Balodis, Janis Iraids, Rusins Freivalds |
| 2014 | ICALP | Weak Parity. | Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian |
| 2013 | FCT | One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata. | Kaspars Balodis |
| 2013 | SOFSEM | Worst Case Analysis of Non-local Games. | Andris Ambainis, Arturs Backurs, Kaspars Balodis, Agnis Skuskovniks, Juris Smotrovs, Madars Virza |
| 2012 | ICALP | 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 |
| 2010 | LREC | Corpus Based Analysis for Multilingual Terminology Entry Compounding. | Andrejs Vasiljevs, Kaspars Balodis |