default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJanis Iraids
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]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)- 2021
- [c14]Andris Ambainis, Kaspars Balodis, Janis Iraids:
A Note About Claw Function with a Small Range. TQC 2021: 6:1-6:5 - [i11]Andris Ambainis, Kaspars Balodis, Janis Iraids:
A note about claw function with a small range. CoRR abs/2103.16390 (2021) - [i10]Janis Iraids, Juris Smotrovs:
Representing polynomial of CONNECTIVITY. CoRR abs/2106.15018 (2021) - 2020
- [c13]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 - [i9]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)
2010 – 2019
- 2019
- [c12]Andris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms. SODA 2019: 1783-1793 - [i8]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
- [i7]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) - 2017
- [c11]Andris Ambainis, Janis Iraids, Daniel Nagaj:
Exact Quantum Query Complexity of \text EXACT_k, l^n. SOFSEM 2017: 243-255 - [i6]Andris Ambainis, Janis Iraids:
Optimal one-shot quantum algorithm for EQUALITY and AND. CoRR abs/1701.06942 (2017) - 2016
- [j2]Andris Ambainis, Janis Iraids:
Optimal One-shot Quantum Algorithm for EQUALITY and AND. Balt. J. Mod. Comput. 4(4) (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) - [c10]Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs:
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. CCC 2016: 25:1-25:19 - [i5]Andris Ambainis, Janis Iraids, Daniel Nagaj:
Exact quantum query complexity of EXACTk, ln. CoRR abs/1608.02374 (2016) - 2015
- [c9]Juris Cernenoks, Janis Iraids, Martins Opmanis, Rihards Opmanis, Karlis Podnieks:
Integer Complexity: Experimental and Analytical Results II. DCFS 2015: 58-69 - [c8]Kaspars Balodis, Janis Iraids, Rusins Freivalds:
Structured Frequency Algorithms. TAMC 2015: 50-61 - [i4]Kaspars Balodis, Janis Iraids:
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection. CoRR abs/1507.03885 (2015) - [i3]Scott Aaronson, Andris Ambainis, Janis Iraids, Martins Kokainis, Juris Smotrovs:
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. CoRR abs/1511.08682 (2015) - 2013
- [c7]Andris Ambainis, Janis Iraids:
Provable Advantage for Quantum Strategies in Random Symmetric XOR Games. TQC 2013: 146-156 - [c6]Andris Ambainis, Janis Iraids, Juris Smotrovs:
Exact Quantum Query Complexity of EXACT and THRESHOLD. TQC 2013: 263-269 - [i2]Andris Ambainis, Janis Iraids, Juris Smotrovs:
Exact quantum query complexity of EXACT and THRESHOLD. CoRR abs/1302.1235 (2013) - [i1]Andris Ambainis, Kaspars Balodis, Janis Iraids, Raitis Ozols, Juris Smotrovs:
Parameterized Quantum Query Complexity of Graph Collision. CoRR abs/1305.1021 (2013) - 2012
- [c5]Andris Ambainis, Janis Iraids, Dmitry Kravchenko, Madars Virza:
Advantage of Quantum Strategies in Random Symmetric XOR Games. MEMICS 2012: 57-68 - [c4]Elina Kalnina, Audris Kalnins, Agris Sostaks, Edgars Celms, Janis Iraids:
Tree Based Domain-Specific Mapping Languages. SOFSEM 2012: 492-504 - 2011
- [c3]Agris Sostaks, Elina Kalnina, Audris Kalnins, Edgars Celms, Janis Iraids:
Solving the TTC 2011 Reengineering Case with MOLA and Higher-Order Transformations. TTC 2011: 159-167 - [c2]Elina Kalnina, Audris Kalnins, Agris Sostaks, Janis Iraids, Edgars Celms:
Saying Hello World with MOLA - A Solution to the TTC 2011 Instructive Case. TTC 2011: 237-252 - 2010
- [c1]Elina Kalnina, Audris Kalnins, Edgars Celms, Agris Sostaks, Janis Iraids:
Generation Mechanisms in Graphical Template Language. MDA/MTDD 2010: 43-52
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:43 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:
