Publications
Search

Publications :: Search

Show author

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

    Author information
    First name: Mathieu
    Last name: Laurière
    DBLP: 125/7744
    Rating: (not rated yet)
    Bookmark:

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

    Show item 1 to 14 of 14  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Mathieu Laurière, Dave Touchette.
    The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Titouan Carette, Mathieu Laurière, Frédéric Magniez.
    Extended Learning Graphs for Triangle Finding.
    34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany 2017 (0) 2017
    Conference paper
    Iordanis Kerenidis, Mathieu Laurière, François Le Gall, Mathys Rennela.
    Information cost of quantum communication protocols.
    Quantum Information Computation 2016, Volume 16 (0) 2016
    Conference paper
    Mathieu Laurière, Olivier Pironneau.
    Dynamic Programming for Mean-Field Type Control.
    J. Optimization Theory and Applications 2016, Volume 169 (0) 2016
    Conference paper
    Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno.
    Robust Bell inequalities from communication complexity.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Titouan Carette, Mathieu Laurière, Frédéric Magniez.
    Extended Learning Graphs for Triangle Finding.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Sophie Laplante, Mathieu Laurière, Alexandre Nolin, Jérémie Roland, Gabriel Senno.
    Robust Bell Inequalities from Communication Complexity.
    11th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2016, September 27-29, 2016, Berlin, Germany 2016 (0) 2016
    Conference paper
    Yves Achdou, Mathieu Laurière.
    Mean Field Type Control with Congestion (II): An Augmented Lagrangian Method.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Lila Fontes, Rahul Jain 0001, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland.
    Relative Discrepancy Does Not Separate Information and Communication Complexity.
    TOCT 2016, Volume 9 (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
    Iordanis Kerenidis, Mathieu Laurière, François Le Gall, Mathys Rennela.
    Privacy in Quantum Communication Complexity.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Iordanis Kerenidis, Mathieu Laurière, David Xiao.
    New lower bounds for privacy in communication protocols.
    Electronic Colloquium on Computational Complexity (ECCC) 2013, Volume 20 (0) 2013
    Conference paper
    Iordanis Kerenidis, Mathieu Laurière, David Xiao.
    New Lower Bounds for Privacy in Communication Protocols.
    Information Theoretic Security - 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings 2014 (0) 2013
    Show item 1 to 14 of 14  

    Your query returned 14 matches in the database.