Kaspars Balodis

32 papers A* 3B 5C 1Misc 1Journal 16Unranked 6

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