Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaris Ozols
Person information
- affiliation: Institute for Quantum Computing, University of Waterloo
- affiliation: University of Latvia, Riga, Latvia
- unicode name: Māris Ozols
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c12]Harry Buhrman, Noah Linden, Laura Mancinska
, Ashley Montanaro, Maris Ozols:
Quantum Majority Vote. ITCS 2023: 29:1-29:1- [c11]Sofiène Jerbi, Arjan Cornelissen, Maris Ozols, Vedran Dunjko:
Quantum Policy Gradient Algorithms. TQC 2023: 13:1-13:24 - 2022
- [i13]Sofiène Jerbi, Arjan Cornelissen, Maris Ozols, Vedran Dunjko:
Quantum policy gradient algorithms. CoRR abs/2212.09328 (2022) - 2021
- [c10]Christian Majenz, Chanelle Matadah Manfouo, Maris Ozols:
Quantum-Access Security of the Winternitz One-Time Signature Scheme. ITC 2021: 21:1-21:22 - [i12]Christian Majenz, Chanelle Matadah Manfouo, Maris Ozols:
Quantum-access security of the Winternitz one-time signature scheme. CoRR abs/2103.12448 (2021) - [i11]Arjan Cornelissen, Nikhil S. Mande, Maris Ozols, Ronald de Wolf:
Exact quantum query complexity of computing Hamming weight modulo powers of two and three. CoRR abs/2112.14682 (2021) - [i10]Christian Majenz, Chanelle Matadah Manfouo, Maris Ozols:
Quantum-access security of the Winternitz one-time signature scheme. IACR Cryptol. ePrint Arch. 2021: 387 (2021) - 2020
- [j6]Gorjan Alagic, Stacey Jeffery, Maris Ozols, Alexander Poremba:
On Quantum Chosen-Ciphertext Attacks and Learning with Errors. Cryptogr. 4(1): 10 (2020) - [j5]Lior Eldar, Maris Ozols, Kevin Thompson:
The Need for Structure in Quantum LDPC Codes. IEEE Trans. Inf. Theory 66(3): 1460-1473 (2020) - [c9]Arjan Cornelissen, Stacey Jeffery, Maris Ozols, Alvaro Piedrafita:
Span Programs and Quantum Time Complexity. MFCS 2020: 26:1-26:14 - [i9]Arjan Cornelissen, Stacey Jeffery, Maris Ozols, Alvaro Piedrafita:
Span programs and quantum time complexity. CoRR abs/2005.01323 (2020)
2010 – 2019
- 2019
- [c8]Gorjan Alagic, Stacey Jeffery, Maris Ozols, Alexander Poremba:
On Quantum Chosen-Ciphertext Attacks and Learning with Errors. TQC 2019: 1:1-1:23 - 2018
- [c7]Adam Bouland, Maris Ozols:
Trading Inverses for an Irrep in the Solovay-Kitaev Theorem. TQC 2018: 6:1-6:15 - [i8]Gorjan Alagic, Stacey Jeffery, Maris Ozols, Alexander Poremba:
On non-adaptive quantum chosen-ciphertext attacks and Learning with Errors. CoRR abs/1808.09655 (2018) - [i7]Gorjan Alagic, Stacey Jeffery, Maris Ozols, Alexander Poremba:
On Quantum Chosen-Ciphertext Attacks and Learning with Errors. IACR Cryptol. ePrint Arch. 2018: 1185 (2018) - 2016
- [j4]Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland:
Quantum Walks Can Find a Marked Element on Any Graph. Algorithmica 74(2): 851-907 (2016) - [i6]Johannes Bausch, Toby S. Cubitt, Maris Ozols:
The Complexity of Translationally-Invariant Spin Chains with Low Local Dimension. CoRR abs/1605.01718 (2016) - 2015
- [i5]Koenraad Audenaert, Nilanjana Datta, Maris Ozols:
Entropy power inequalities for qudits. CoRR abs/1503.04213 (2015) - [i4]Maris Ozols:
How to combine three quantum states. CoRR abs/1508.00860 (2015) - 2013
- [j3]Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. ACM Trans. Comput. Theory 5(3): 11:1-11:33 (2013) - [c6]Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler:
Easy and Hard Functions for the Boolean Hidden Shift Problem. TQC 2013: 50-79 - [i3]Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler:
Easy and hard functions for the Boolean hidden shift problem. CoRR abs/1304.4642 (2013) - [i2]Maris Ozols, Graeme Smith, John A. Smolin:
Bound entangled states with secret key and their classical counterpart. CoRR abs/1305.0848 (2013) - 2012
- [c5]Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. ITCS 2012: 290-308 - 2011
- [j2]Andrew M. Childs, Debbie W. Leung, Laura Mancinska, Maris Ozols:
Characterization of universal two-qubit Hamiltonians. Quantum Inf. Comput. 11(1&2): 19-39 (2011) - [i1]Maris Ozols, Martin Roetteler, Jérémie Roland:
Quantum rejection sampling. CoRR abs/1103.2774 (2011) - 2010
- [c4]Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland:
Finding Is as Easy as Detecting for Quantum Walks. ICALP (1) 2010: 540-551
2000 – 2009
- 2009
- [j1]Rusins Freivalds, Maris Ozols, Laura Mancinska:
Improved constructions of mixed state quantum automata. Theor. Comput. Sci. 410(20): 1923-1931 (2009) - 2006
- [c3]Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina, Rubens Agadzanjans, Ansis Rosmanis:
Principles of Optimal Probabilistic Decision Tree Construction. FCS 2006: 116-122 - 2005
- [c2]Laura Mancinska, Maris Ozols, Renate Praude, Agnese Zalcmane:
Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet. FCS 2005: 161-168 - [c1]Raitis Ozols, Rusins Freivalds, Laura Mancinska, Maris Ozols:
Size of Nondeterministic and Deterministic Automata for Certain Languages. FCS 2005: 169-175
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:41 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:
