The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Jérémie Roland" ( http://dblp.L3S.de/Authors/Jérémie_Roland )

  Author page on DBLP  Author page in RDF  Community of Jérémie Roland in ASPL-2

Publication years (Num. hits)
2007-2011 (18) 2012 (5)
Publication types (Num. hits)
article(15) inproceedings(8)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 5 keywords

Results
Found 23 publication records. Showing 23 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao Lower bounds on information complexity via zero-communication protocols and applications. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Sophie Laplante, Virginie Lerays, Jérémie Roland Classical and quantum partition bound and detector inefficiency. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2012 DBLP  BibTeX  RDF
1Sophie Laplante, Virginie Lerays, Jérémie Roland Classical and quantum partition bound and detector inefficiency Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao Lower bounds on information complexity via zero-communication protocols and applications Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Maris Ozols, Martin Roetteler, Jérémie Roland Quantum rejection sampling. Search on Bibsonomy ITCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland The communication complexity of non-signaling distributions. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2011 DBLP  BibTeX  RDF
1Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland Non-local box complexity and secure function evaluation. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2011 DBLP  BibTeX  RDF
1Troy Lee, Jérémie Roland A strong direct product theorem for quantum query complexity Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Maris Ozols, Martin Roetteler, Jérémie Roland Quantum rejection sampling Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Dmitry Gavinsky, Martin Roetteler, Jérémie Roland Quantum algorithm for the Boolean hidden shift problem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha Search via Quantum Walk. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dmitry Gavinsky, Martin Roetteler, Jérémie Roland Quantum Algorithm for the Boolean Hidden Shift Problem. Search on Bibsonomy COCOON The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland Symmetry-Assisted Adversaries for Quantum State Generation. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland Symmetry-assisted adversaries for quantum state generation. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland Symmetry-assisted adversaries for quantum state generation Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland Finding Is as Easy as Detecting for Quantum Walks. Search on Bibsonomy ICALP The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Boris Altshuler, Hari Krovi, Jérémie Roland Adiabatic quantum optimization fails for random instances of NP-complete problems Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Boris Altshuler, Hari Krovi, Jérémie Roland Anderson localization casts clouds over adiabatic quantum optimization Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Jérémie Roland, Mario Szegedy Amortized Communication Complexity of Distributions. Search on Bibsonomy ICALP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland The Communication Complexity of Non-signaling Distributions. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland Non-Local Box Complexity and Secure Function Evaluation. Search on Bibsonomy FSTTCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olga Lopez Acevedo, Jérémie Roland, Nicolas J. Cerf Exploring scalar quantum walks on Cayley graphs. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2008 DBLP  BibTeX  RDF
1Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha Search via quantum walk. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF amplitude amplification, phase gap, recursive amplitude amplification, reflection operator, spectral gap, search, Markov chain, phase estimation, hitting time, quantum walk
Displaying result #1 - #23 of 23 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.