( en | de | ru )

 

Disambiguation of "Balodis, Kaspars"

Author of the publication

copydeleteadd this publication to your clipboard
Unambiguous DNFs and Alon-Saks-Seymour.

, , , , and . FOCS, page 116-124. IEEE, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kaspars Dadzis

Elza Balodis

Francis Balodis

 

Other publications of authors with the same name

Quantum Speedups for Exponential-Time Dynamic Programming Algorithms., , , , , and . SODA, page 1783-1793. SIAM, (2019)Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language., , , , , , , , and . MFCS, volume 170 of LIPIcs, page 8:1-8:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Frequency Prediction of Functions., , and . MEMICS, volume 7119 of Lecture Notes in Computer Science, page 76-83. Springer, (2011)Intent Detection System Based on Word Embeddings., and . AIMSA, volume 11089 of Lecture Notes in Computer Science, page 25-35. Springer, (2018)Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection., and . Balt. J. Mod. Comput., (2016)Two-way frequency finite automata., , and . NCMA, volume 321 of books@ocg.at, page 75-88. Österreichische Computer Gesellschaft, (2016)Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection., and . CoRR, (2015)Parameterized Quantum Query Complexity of Graph Collision, , , , and . CoRR, (2013)Separations in query complexity based on pointer functions., , , , , and . STOC, page 800-813. ACM, (2016)One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata.. FCT, volume 8070 of Lecture Notes in Computer Science, page 40-47. Springer, (2013)