I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Iraids, Jānis
25
results:
Search for persons
X
Format
Online (25)
Mediatypes
Articles (Online) (1)
Bookchapter (Online) (1)
OpenAccess-fulltext (23)
Sorted by: Relevance
Sorted by: Year
?
1
Quantum bounds for 2D-grid and Dyck language:
Ambainis, Andris
;
Balodis, Kaspars
;
Iraids, Jānis
...
Quantum Information Processing. 22 (2023) 5 - p. , 2023
Link:
https://doi.org/10.1007/..
?
2
Quantum speedups for Exponential-Time dynamic programming a..:
, In:
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
,
Ambainis, Andris
;
Balodis, Kaspars
;
Iraids, Jānis
... - p. 1783-1793 , 2019
Link:
https://dl.acm.org/doi/1..
?
3
Representing polynomial of ST-CONNECTIVITY:
Iraids, Jānis
;
Smotrovs, Juris
http://arxiv.org/abs/2106.15018. , 2021
Link:
http://arxiv.org/abs/210..
?
4
A note about claw function with a small range:
Ambainis, Andris
;
Balodis, Kaspars
;
Iraids, Jānis
http://arxiv.org/abs/2103.16390. , 2021
Link:
http://arxiv.org/abs/210..
?
5
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Languag:
Ambainis, Andris
;
Balodis, Kaspars
;
Iraids, Jānis
...
http://arxiv.org/abs/2007.03402. , 2020
Link:
http://arxiv.org/abs/200..
?
6
Quantum Lower Bounds for 2D-Grid and Dyck Language:
Ambainis, Andris
;
Balodis, Kaspars
;
Iraids, Jānis
..
http://arxiv.org/abs/1911.12638. , 2019
Link:
http://arxiv.org/abs/191..
?
7
Quantum Speedups for Exponential-Time Dynamic Programming A..:
Ambainis, Andris
;
Balodis, Kaspars
;
Iraids, Jānis
...
http://arxiv.org/abs/1807.05209. , 2018
Link:
http://arxiv.org/abs/180..
?
8
Optimal one-shot quantum algorithm for EQUALITY and AND:
Ambainis, Andris
;
Iraids, Janis
http://arxiv.org/abs/1701.06942. , 2017
Link:
http://arxiv.org/abs/170..
?
9
Polynomials, Quantum Query Complexity, and Grothendieck's I..:
Aaronson, Scott
;
Ambainis, Andris
;
Iraids, Janis
..
doi:10.4230/LIPIcs.CCC.2016.25. , 2016
Link:
https://doi.org/10.4230/..
?
10
Exact quantum query complexity of $\rm{EXACT}_{k,l}^n$:
Ambainis, Andris
;
Iraids, Jānis
;
Nagaj, Daniel
http://arxiv.org/abs/1608.02374. , 2016
Link:
http://arxiv.org/abs/160..
?
11
Quantum Lower Bound for Graph Collision Implies Lower Bound..:
Balodis, Kaspars
;
Iraids, Jānis
http://arxiv.org/abs/1507.03885. , 2015
Link:
http://arxiv.org/abs/150..
?
12
Polynomials, Quantum Query Complexity, and Grothendieck's I..:
Aaronson, Scott
;
Ambainis, Andris
;
Iraids, Jānis
..
http://arxiv.org/abs/1511.08682. , 2015
Link:
http://arxiv.org/abs/151..
?
13
Integer Complexity: Experimental and Analytical Results II:
Čerņenoks, Juris
;
Iraids, Jānis
;
Opmanis, Mārtiņš
..
http://arxiv.org/abs/1409.0446. , 2014
Link:
http://arxiv.org/abs/140..
?
14
Parameterized Quantum Query Complexity of Graph Collision:
Ambainis, Andris
;
Balodis, Kaspars
;
Iraids, Jānis
..
http://arxiv.org/abs/1305.1021. , 2013
Link:
http://arxiv.org/abs/130..
?
15
Exact Quantum Query Complexity of EXACT and THRESHOLD:
Ambainis, Andris
;
Iraids, Janis
;
Smotrovs, Juris
doi:10.4230/LIPIcs.TQC.2013.263. , 2013
Link:
https://doi.org/10.4230/..
1-15