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 50 to 74 of 75  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Gábor Ivanyos, François Le Gall, Yuichi Yoshida.
    On the distance between non-isomorphic groups
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    François Le Gall.
    Quantum Private Information Retrieval with Sublinear Communication Complexity
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    François Le Gall, Yuichi Yoshida.
    Property Testing for Cyclic Groups and Beyond.
    Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings 2011 (0) 2011
    Journal article
    François Le Gall, Shota Nakagawa, Harumichi Nishimura.
    On QMA Protocols with Two Short Quantum Proofs
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani.
    The One-Way Communication Complexity of Subgroup Membership.
    Chicago J. Theor. Comput. Sci. 2011, Volume 2011 (0) 2011
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    Constructing quantum network coding schemes from classical nonlinear protocols.
    2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russia, July 31 - August 5, 2011 2011 (0) 2011
    Journal article
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    Constructing Quantum Network Coding Schemes from Classical Nonlinear Protocols
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani.
    The quantum query complexity of certification.
    Quantum Information Computation 2010, Volume 10 (0) 2010
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    Perfect quantum network communication protocol based on classical network coding.
    IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings 2010 (0) 2010
    Journal article
    François Le Gall.
    An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    François Le Gall.
    An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem.
    27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France 2010 (0) 2010
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    General Scheme for Perfect Quantum Network Coding with Free Classical Communication.
    Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I 2009 (0) 2009
    Conference paper
    Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani.
    The One-Way Communication Complexity of Group Membership
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura, Martin Rötteler.
    Perfect Quantum Network Communication Protocol Based on Classical Network Coding
    CoRR 2009, Volume 0 (0) 2009
    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
    Conference paper
    François Le Gall.
    Exponential Separation of Quantum and Classical Online Space Complexity
    CoRR 2006, Volume 0 (0) 2006
    Show item 50 to 74 of 75  

    Your query returned 75 matches in the database.