Publications
Search

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 37  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland.
    Quantum Walks Can Find a Marked Element on Any Graph.
    Algorithmica 2016, Volume 74 (0) 2016
    Conference paper
    Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland.
    Relative Discrepancy does not separate Information and Communication Complexity.
    Electronic Colloquium on Computational Complexity (ECCC) 2015, Volume 22 (0) 2015
    Conference paper
    Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland.
    Relative Discrepancy Does not Separate Information and Communication Complexity.
    Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I 2015 (0) 2015
    Conference paper
    Mathieu Brandeho, Jérémie Roland.
    A Universal Adiabatic Quantum Query Algorithm.
    10th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2015, May 20-22, 2015, Brussels, Belgium 2015 (0) 2015
    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.
    SIAM J. Comput. 2015, Volume 44 (0) 2015
    Journal article
    Mathieu Brandeho, Jérémie Roland.
    An optimal adiabatic quantum query algorithm.
    CoRR 2014, Volume 0 (0) 2014
    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.
    TOCT 2013, Volume 5 (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
    Show item 1 to 10 of 37  

    Your query returned 37 matches in the database.