Publications
Search

Publications :: Search

Show author

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

    Author information
    First name: François Le
    Last name: Gall
    DBLP: 10/5740
    Rating: (not rated yet)
    Bookmark:

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

    Show item 69 to 78 of 80  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani.
    The quantum query complexity of certification
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    General Scheme for Perfect Quantum Network Coding with Free Classical Communication
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    François Le Gall.
    Exponential Separation of Quantum and Classical Online Space Complexity.
    Theory Comput. Syst. 2009, Volume 45 (0) 2009
    Conference paper
    François Le Gall.
    Efficient Isomorphism Testing for a Class of Group Extensions.
    26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings 2009 (0) 2009
    Conference paper
    Yoshifumi Inui, François Le Gall.
    Quantum Property Testing of Group Solvability.
    LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings 2008 (0) 2008
    Conference paper
    François Le Gall.
    Efficient Isomorphism Testing for a Class of Group Extensions
    CoRR 2008, Volume 0 (0) 2008
    Journal article
    Yoshifumi Inui, François Le Gall.
    Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups.
    Quantum Information Computation 2007, Volume 7 (0) 2007
    Conference paper
    Yoshifumi Inui, François Le Gall.
    Quantum Property Testing of Group Solvability.
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    François Le Gall.
    Quantum Weakly Nondeterministic Communication Complexity.
    Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings 2006 (0) 2006
    Conference paper
    François Le Gall.
    Exponential separation of quantum and classical online space complexity.
    SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006 2006 (0) 2006
    Show item 69 to 78 of 80  

    Your query returned 80 matches in the database.