Kaspars Balodis

According to our database1, Kaspars Balodis authored at least 21 papers between 2010 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A note about claw function with a small range.
CoRR, 2021

Several Separations Based on a Partial Boolean Function.
CoRR, 2021

2020
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
FastText-Based Intent Detection for Inflected Languages.
Inf., 2019

Quantum Lower Bounds for 2D-Grid and Dyck Language.
CoRR, 2019

Quantum Speedups for Exponential-Time Dynamic Programming Algorithms.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Intent Detection System Based on Word Embeddings.
Proceedings of the Artificial Intelligence: Methodology, Systems, and Applications, 2018

2017
Separations in Query Complexity Based on Pointer Functions.
J. ACM, 2017

2016
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection.
Balt. J. Mod. Comput., 2016

Two-way frequency finite automata.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015
Structured Frequency Algorithms.
Proceedings of the Theory and Applications of Models of Computation, 2015

On the Hierarchy Classes of Finite Ultrametric Automata.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014
Counting with Probabilistic and Ultrametric Finite Automata.
Proceedings of the Computing with New Resources, 2014

2013
Weak Parity.
Electron. Colloquium Comput. Complex., 2013

Parameterized Quantum Query Complexity of Graph Collision
CoRR, 2013

Worst Case Analysis of Non-local Games.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012
Quantum Strategies Are Better Than Classical in Almost Any XOR Game.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Quantum strategies are better than classical in almost any XOR game
CoRR, 2011

Frequency Prediction of Functions.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2011

2010
Corpus Based Analysis for Multilingual Terminology Entry Compounding.
Proceedings of the International Conference on Language Resources and Evaluation, 2010


  Loading...