Institute for Quantum Computing, University of Waterloo
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| i2 | Andrew M. Childs, Robin Kothari, Maris Ozols, Martin Roetteler: Easy and hard functions for the Boolean hidden shift problem. CoRR abs/1304.4642 (2013) | |
| 2012 | ||
| c5 | ||
| 2011 | ||
| j2 | Andrew M. Childs, Debbie W. Leung, Laura Mancinska, Maris Ozols: Characterization of universal two-qubit Hamiltonians. Quantum Information & Computation 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 | |
| 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 | |
Data released under the ODC-BY 1.0 license — See also our legal information page