default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaspars Balodis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j4]Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev
, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs:
Quantum bounds for 2D-grid and Dyck language. Quantum Inf. Process. 22(5): 194 (2023)- 2019
- [j3]Kaspars Balodis, Daiga Deksne:
FastText-Based Intent Detection for Inflected Languages. Inf. 10(5): 161 (2019) - 2017
- [j2]Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
Separations in Query Complexity Based on Pointer Functions. J. ACM 64(5): 32:1-32:24 (2017) - 2016
- [j1]Kaspars Balodis, Janis Iraids:
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection. Balt. J. Mod. Comput. 4(4) (2016)
Conference and Workshop Papers
- 2021
- [c16]Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs and Alon-Saks-Seymour. FOCS 2021: 116-124 - [c15]Andris Ambainis, Kaspars Balodis, Janis Iraids:
A Note About Claw Function with a Small Range. TQC 2021: 6:1-6:5 - 2020
- [c14]Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs:
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. MFCS 2020: 8:1-8:14 - 2019
- [c13]Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. SODA 2019: 1783-1793 - 2018
- [c12]Kaspars Balodis, Daiga Deksne:
Intent Detection System Based on Word Embeddings. AIMSA 2018: 25-35 - 2016
- [c11]Kaspars Balodis, Maksims Dimitrijevs, Abuzer Yakaryilmaz:
Two-way frequency finite automata. NCMA 2016: 75-88 - [c10]Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
Separations in query complexity based on pointer functions. STOC 2016: 800-813 - 2015
- [c9]Rihards Krislauks, Kaspars Balodis:
On the Hierarchy Classes of Finite Ultrametric Automata. SOFSEM 2015: 314-326 - [c8]Kaspars Balodis, Janis Iraids, Rusins Freivalds:
Structured Frequency Algorithms. TAMC 2015: 50-61 - 2014
- [c7]Kaspars Balodis:
Counting with Probabilistic and Ultrametric Finite Automata. Computing with New Resources 2014: 3-16 - [c6]Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian:
Weak Parity. ICALP (1) 2014: 26-38 - 2013
- [c5]Kaspars Balodis:
One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata. FCT 2013: 40-47 - [c4]Andris Ambainis, Arturs Backurs, Kaspars Balodis, Agnis Skuskovniks, Juris Smotrovs, Madars Virza:
Worst Case Analysis of Non-local Games. SOFSEM 2013: 121-132 - 2012
- [c3]Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitrijs Kravcenko, Raitis Ozols, Juris Smotrovs, Madars Virza:
Quantum Strategies Are Better Than Classical in Almost Any XOR Game. ICALP (1) 2012: 25-37 - 2011
- [c2]Kaspars Balodis, Ilja Kucevalovs, Rusins Freivalds:
Frequency Prediction of Functions. MEMICS 2011: 76-83 - 2010
- [c1]Andrejs Vasiljevs, Kaspars Balodis:
Corpus Based Analysis for Multilingual Terminology Entry Compounding. LREC 2010
Informal and Other Publications
- 2021
- [i12]Kaspars Balodis:
Several Separations Based on a Partial Boolean Function. CoRR abs/2103.05593 (2021) - [i11]Andris Ambainis, Kaspars Balodis, Janis Iraids:
A note about claw function with a small range. CoRR abs/2103.16390 (2021) - 2020
- [i10]Andris Ambainis, Kaspars Balodis, Janis Iraids, Kamil Khadiev, Vladislavs Klevickis, Krisjanis Prusis, Yixin Shen, Juris Smotrovs, Jevgenijs Vihrovs:
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language. CoRR abs/2007.03402 (2020) - 2019
- [i9]Andris Ambainis, Kaspars Balodis, Janis Iraids, Krisjanis Prusis, Juris Smotrovs:
Quantum Lower Bounds for 2D-Grid and Dyck Language. CoRR abs/1911.12638 (2019) - 2018
- [i8]Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. CoRR abs/1807.05209 (2018) - 2015
- [i7]Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
Separations in Query Complexity Based on Pointer Functions. CoRR abs/1506.04719 (2015) - [i6]Kaspars Balodis, Janis Iraids:
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection. CoRR abs/1507.03885 (2015) - [i5]Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
Separations in Query Complexity Based on Pointer Functions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2013
- [i4]Andris Ambainis, Kaspars Balodis, Janis Iraids, Raitis Ozols, Juris Smotrovs:
Parameterized Quantum Query Complexity of Graph Collision. CoRR abs/1305.1021 (2013) - [i3]Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian:
Weak Parity. CoRR abs/1312.0036 (2013) - [i2]Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian:
Weak Parity. Electron. Colloquium Comput. Complex. TR13 (2013) - 2011
- [i1]Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitry Kravchenko, Raitis Ozols, Juris Smotrovs, Madars Virza:
Quantum strategies are better than classical in almost any XOR game. CoRR abs/1112.3330 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
