- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j5 |      | Troy Lee, Jérémie Roland: A strong direct product theorem for quantum query complexity. Computational Complexity 22(2): 429-462 (2013) |
| c12 | | Loïck Magnin, Jérémie Roland: Explicit relation between all lower bound techniques for quantum query complexity. STACS 2013: 434-445 |
| 2012 | ||
| c11 | | Troy Lee, Jérémie Roland: A Strong Direct Product Theorem for Quantum Query Complexity. IEEE Conference on Computational Complexity 2012: 236-246 |
| c10 | | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao: Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. FOCS 2012: 500-509 |
| c9 | | Sophie Laplante, Virginie Lerays, Jérémie Roland: Classical and Quantum Partition Bound and Detector Inefficiency. ICALP (1) 2012: 617-628 |
| c8 | | |
| i13 | | Sophie Laplante, Virginie Lerays, Jérémie Roland: Classical and quantum partition bound and detector inefficiency. CoRR abs/1203.4155 (2012) |
| i12 | | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao: Lower bounds on information complexity via zero-communication protocols and applications. CoRR abs/1204.1505 (2012) |
| i11 | | Loïck Magnin, Jérémie Roland: Explicit relation between all lower bound techniques for quantum query complexity. CoRR abs/1209.2713 (2012) |
| i10 | | Sophie Laplante, Virginie Lerays, Jérémie Roland: Classical and quantum partition bound and detector inefficiency. Electronic Colloquium on Computational Complexity (ECCC) 19: 23 (2012) |
| i9 | | Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao: Lower bounds on information complexity via zero-communication protocols and applications. Electronic Colloquium on Computational Complexity (ECCC) 19: 38 (2012) |
| i8 | | Loïck Magnin, Jérémie Roland: Explicit relation between all lower bound techniques for quantum query complexity. Electronic Colloquium on Computational Complexity (ECCC) 19: 117 (2012) |
| 2011 | ||
| j4 | | Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland: Non-local box complexity and secure function evaluation. Quantum Information & Computation 11(1&2): 40-69 (2011) |
| j3 | | Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland: The communication complexity of non-signaling distributions. Quantum Information & Computation 11(7&8): 649-676 (2011) |
| j2 | | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha: Search via Quantum Walk. SIAM J. Comput. 40(1): 142-164 (2011) |
| c7 | | Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland: Symmetry-Assisted Adversaries for Quantum State Generation. IEEE Conference on Computational Complexity 2011: 167-177 |
| c6 | | Dmitry Gavinsky, Martin Roetteler, Jérémie Roland: Quantum Algorithm for the Boolean Hidden Shift Problem. COCOON 2011: 158-167 |
| i7 | | Maris Ozols, Martin Roetteler, Jérémie Roland: Quantum rejection sampling. CoRR abs/1103.2774 (2011) |
| i6 | | Dmitry Gavinsky, Martin Roetteler, Jérémie Roland: Quantum algorithm for the Boolean hidden shift problem. CoRR abs/1103.3017 (2011) |
| i5 | | Troy Lee, Jérémie Roland: A strong direct product theorem for quantum query complexity. CoRR abs/1104.4468 (2011) |
| 2010 | ||
| c5 | | 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 |
| i4 | | Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland: Symmetry-assisted adversaries for quantum state generation. CoRR abs/1012.2112 (2010) |
| i3 | | Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland: Symmetry-assisted adversaries for quantum state generation. Electronic Colloquium on Computational Complexity (ECCC) 17: 191 (2010) |
| 2009 | ||
| c4 | | Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland: Non-Local Box Complexity and Secure Function Evaluation. FSTTCS 2009: 239-250 |
| c3 | | Jérémie Roland, Mario Szegedy: Amortized Communication Complexity of Distributions. ICALP (1) 2009: 738-749 |
| c2 | | Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland: The Communication Complexity of Non-signaling Distributions. MFCS 2009: 270-281 |
| i2 | | Boris Altshuler, Hari Krovi, Jérémie Roland: Adiabatic quantum optimization fails for random instances of NP-complete problems. CoRR abs/0908.2782 (2009) |
| i1 | | Boris Altshuler, Hari Krovi, Jérémie Roland: Anderson localization casts clouds over adiabatic quantum optimization. CoRR abs/0912.0746 (2009) |
| 2008 | ||
| j1 | | Olga Lopez Acevedo, Jérémie Roland, Nicolas J. Cerf: Exploring scalar quantum walks on Cayley graphs. Quantum Information & Computation 8(1): 68-81 (2008) |
| 2007 | ||
| c1 | | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha: Search via quantum walk. STOC 2007: 575-584 |
Colors in the list of coauthors
Last update Sat May 25 02:51:04 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page