Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Jérémie
Last name:	Roland
DBLP:	11/7187
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 30  

Select a publication
Show	Title	Venue	Rating	Date
	Conference paper Loïck Magnin, Jérémie Roland. Explicit relation between all lower bound techniques for quantum query complexity.	30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013	(0)	2013
	Conference paper Troy Lee, Jérémie Roland. A strong direct product theorem for quantum query complexity.	Computational Complexity 2013, Volume 22	(0)	2013
	Conference paper Maris Ozols, Martin Rötteler, Jérémie Roland. Quantum rejection sampling.	Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8-10, 2012 2012	(0)	2012
	Conference paper Sophie Laplante, Virginie Lerays, Jérémie Roland. Classical and Quantum Partition Bound and Detector Inefficiency.	Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012	(0)	2012
	Conference paper Troy Lee, Jérémie Roland. A Strong Direct Product Theorem for Quantum Query Complexity.	Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012 2012	(0)	2012
	Journal article Loïck Magnin, Jérémie Roland. Explicit relation between all lower bound techniques for quantum query complexity	CoRR 2012, Volume 0	(0)	2012
	Conference paper Sophie Laplante, Virginie Lerays, Jérémie Roland. Classical and quantum partition bound and detector inefficiency	CoRR 2012, Volume 0	(0)	2012
	Conference paper Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao. Lower bounds on information complexity via zero-communication protocols and applications	CoRR 2012, Volume 0	(0)	2012
	Conference paper Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao. Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications.	53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012 2012	(0)	2012
	Conference paper 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) 2012, Volume 19	(0)	2012

Show item 1 to 10 of 30  

Your query returned 30 matches in the database.