default search action
Ansis Rosmanis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j5]Nathan Lindzey, Ansis Rosmanis:
A tight lower bound for non-coherent index erasure. Quantum Inf. Comput. 22(7&8): 594-626 (2022) - [i8]François Le Gall, Ansis Rosmanis:
Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model. CoRR abs/2212.02768 (2022) - 2021
- [i7]Ansis Rosmanis:
Tight Bounds for Inverting Permutations via Compressed Oracle Arguments. CoRR abs/2103.08975 (2021) - 2020
- [c10]Nathan Lindzey, Ansis Rosmanis:
A Tight Lower Bound For Non-Coherent Index Erasure. ITCS 2020: 59:1-59:37 - [c9]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs
, Robin Kothari
Quantum Coupon Collector. TQC 2020: 10:1-10:17 - [i6]Srinivasan Arunachalam, Aleksandrs Belovs, Andrew M. Childs, Robin Kothari, Ansis Rosmanis, Ronald de Wolf:
Quantum Coupon Collector. CoRR abs/2002.07688 (2020)
2010 – 2019
- 2019
- [j4]Yassine Hamoudi
Quantum and classical algorithms for approximate submodular function minimization. Quantum Inf. Comput. 19(15&16): 1325-1349 (2019) - [c8]François Le Gall, Harumichi Nishimura
Quantum Advantage for the LOCAL Model in Distributed Computing. STACS 2019: 49:1-49:14 - [i5]Nathan Lindzey, Ansis Rosmanis:
A Tight Lower Bound for Index Erasure. CoRR abs/1902.07336 (2019) - [i4]Yassine Hamoudi
Quantum and Classical Algorithms for Approximate Submodular Function Minimization. CoRR abs/1907.05378 (2019) - 2018
- [j3]Aleksandrs Belovs, Ansis Rosmanis:
Adversary lower bounds for the collision and the set equality problems. Quantum Inf. Comput. 18(3&4): 200-224 (2018) - [c7]Aleksandrs Belovs, Ansis Rosmanis:
Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems. TQC 2018: 3:1-3:15 - [i3]François Le Gall, Harumichi Nishimura, Ansis Rosmanis:
Quantum Advantage for the LOCAL Model in Distributed Computing. CoRR abs/1810.10838 (2018) - 2017
- [c6]Gus Gutoski, Ansis Rosmanis, Jamie Sikora:
Fidelity of Quantum Strategies with Applications to Cryptography. TQC 2017: 8:1-8:13 - 2014
- [j2]Aleksandrs Belovs, Ansis Rosmanis:
On the Power of Non-adaptive Learning Graphs. Comput. Complex. 23(2): 323-354 (2014) - [j1]Ansis Rosmanis:
Quantum Adversary Lower Bound for Element Distinctness with Small Range. Chic. J. Theor. Comput. Sci. 2014 (2014) - [c5]Andris Ambainis, Ansis Rosmanis, Dominique Unruh
Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding. FOCS 2014: 474-483 - [i2]Andris Ambainis, Ansis Rosmanis, Dominique Unruh:
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding. CoRR abs/1404.6898 (2014) - [i1]Andris Ambainis, Ansis Rosmanis, Dominique Unruh:
Quantum Attacks on Classical Proof Systems - The Hardness of Quantum Rewinding. IACR Cryptol. ePrint Arch. 2014: 296 (2014) - 2013
- [c4]Aleksandrs Belovs, Ansis Rosmanis:
On the Power of Non-adaptive Learning Graphs. CCC 2013: 44-55
2000 – 2009
- 2007
- [c3]Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs:
Multi-letter Reversible and Quantum Finite Automata. Developments in Language Theory 2007: 60-71 - 2006
- [c2]Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina, Rubens Agadzanjans, Ansis Rosmanis:
Principles of Optimal Probabilistic Decision Tree Construction. FCS 2006: 116-122 - [c1]Ansis Rosmanis, Ilze Dzelme-Berzina:
Mixed States in Quantum Cryptography. FCS 2006: 214-218
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-24 22:55 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: