Kaspars Balodis

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Unambiguous DNFs and Alon-Saks-Seymour	2025-08-13	Paper
A note about claw function with a small range (available as arXiv preprint)	2023-06-26	Paper
Quantum bounds for 2D-grid and Dyck language Quantum Information Processing	2023-06-01	Paper
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language (available as arXiv preprint)	2022-07-18	Paper
Quantum speedups for exponential-time dynamic programming algorithms Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-10-15	Paper
Separations in query complexity based on pointer functions Journal of the ACM	2018-05-17	Paper
Separations in query complexity based on pointer functions Proceedings of the forty-eighth annual ACM symposium on Theory of Computing	2017-09-29	Paper
Structured Frequency Algorithms Lecture Notes in Computer Science	2015-09-30	Paper
Counting with probabilistic and ultrametric finite automata Computing with New Resources	2015-09-08	Paper
On the hierarchy classes of finite ultrametric automata Lecture Notes in Computer Science	2015-02-20	Paper
Worst case analysis of non-local games Lecture Notes in Computer Science	2014-11-04	Paper
Weak parity Automata, Languages, and Programming	2014-07-01	Paper
Weak parity Automata, Languages, and Programming	2014-07-01	Paper
One alternation can be more powerful than randomization in small and fast two-way finite automata Fundamentals of Computation Theory	2013-08-16	Paper
Quantum strategies are better than classical in almost any XOR game Automata, Languages, and Programming	2013-08-12	Paper
Integer Complexity: Experimental and Analytical Results	2012-03-29	Paper

Research outcomes over time

This page was built for person: Kaspars Balodis