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 1 to 25 of 81  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    François Le Gall.
    A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication.
    Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings 2012 (0) 2012
    Conference paper
    François Le Gall.
    Algebraic complexity theory and matrix multiplication.
    International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014 2014 (0) 2014
    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
    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
    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
    Conference paper
    François Le Gall.
    Efficient Isomorphism Testing for a Class of Group Extensions
    CoRR 2008, Volume 0 (0) 2008
    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
    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
    François Le Gall.
    Exponential Separation of Quantum and Classical Online Space Complexity
    CoRR 2006, Volume 0 (0) 2006
    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.
    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
    Andris Ambainis, Yuval Filmus, François Le Gall.
    Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method.
    Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015 2015 (0) 2015
    Journal article
    Andris Ambainis, Yuval Filmus, François Le Gall.
    Fast Matrix Multiplication: Limitations of the Laser Method.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    Andris Ambainis, Yuval Filmus, François Le Gall.
    Fast Matrix Multiplication: Limitations of the Laser Method.
    Electronic Colloquium on Computational Complexity (ECCC) 2014, Volume 21 (0) 2014
    Conference paper
    François Le Gall.
    Faster Algorithms for Rectangular Matrix Multiplication
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    François Le Gall.
    Faster Algorithms for Rectangular Matrix Multiplication.
    53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012 2012 (0) 2012
    Conference paper
    François Le Gall.
    Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    François Le Gall.
    Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems.
    Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings 2016 (0) 2016
    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
    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
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Generalized Quantum Arthur-Merlin Games.
    30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA 2015 (0) 2015
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Generalized Quantum Arthur-Merlin Games.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    François Le Gall.
    Improved output-sensitive quantum algorithms for Boolean matrix multiplication.
    Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012 2012 (0) 2012
    Journal article
    François Le Gall.
    Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments.
    CoRR 2014, Volume 0 (0) 2014
    Show item 1 to 25 of 81  

    Your query returned 81 matches in the database.