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 78 of 78  
    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
    Conference paper
    François Le Gall.
    Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments.
    55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014 2014 (0) 2014
    Conference paper
    François Le Gall.
    Improved Time-Efficient Output-Sensitive Quantum Algorithms for Boolean Matrix Multiplication
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Stacey Jeffery, Robin Kothari, François Le Gall, Frédéric Magniez.
    Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision.
    Algorithmica 2016, Volume 76 (0) 2016
    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
    Tomoyuki Morimae, Harumichi Nishimura, François Le Gall.
    Modified group non-membership is in AWPP.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Tomoyuki Morimae, Harumichi Nishimura, François Le Gall.
    Modified Group Non-Membership is in Promise-AWPP relative to group oracles.
    Quantum Information Computation 2017, Volume 17 (0) 2017
    Journal article
    François Le Gall, Shota Nakagawa, Harumichi Nishimura.
    On QMA Protocols with Two Short Quantum Proofs
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    François Le Gall, Shota Nakagawa, Harumichi Nishimura.
    On QMA protocols with two short quantum proofs.
    Quantum Information Computation 2012, Volume 12 (0) 2012
    Journal article
    Gábor Ivanyos, François Le Gall, Yuichi Yoshida.
    On the distance between non-isomorphic groups
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Gábor Ivanyos, François Le Gall, Yuichi Yoshida.
    On the distance between non-isomorphic groups.
    Eur. J. Comb. 2012, Volume 33 (0) 2012
    Journal article
    François Le Gall, David J. Rosenbaum.
    On the Group and Color Isomorphism Problems.
    CoRR 2016, Volume 0 (0) 2016
    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
    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.
    Powers of Tensors and Fast Matrix Multiplication.
    CoRR 2014, Volume 0 (0) 2014
    Conference paper
    François Le Gall.
    Powers of tensors and fast matrix multiplication.
    International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014 2014 (0) 2014
    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
    Dean Doron, François Le Gall, Amnon Ta-Shma.
    Probabilistic logarithmic-space algorithms for Laplacian solvers.
    Electronic Colloquium on Computational Complexity (ECCC) 2017, Volume 24 (0) 2017
    Conference paper
    Dean Doron, François Le Gall, Amnon Ta-Shma.
    Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA 2017 (0) 2017
    Journal article
    François Le Gall, Yuichi Yoshida.
    Property Testing for Cyclic Groups and Beyond
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    François Le Gall, Yuichi Yoshida.
    Property testing for cyclic groups and beyond.
    J. Comb. Optim. 2013, Volume 26 (0) 2013
    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
    Conference paper
    François Le Gall, Shogo Nakajima.
    Quantum Algorithm for Triangle Finding in Sparse Graphs.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    François Le Gall, Shogo Nakajima.
    Quantum Algorithm for Triangle Finding in Sparse Graphs.
    Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings 2015 (0) 2015
    Journal article
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum Algorithms for Finding Constant-sized Sub-hypergraphs over 3-uniform Hypergraphs.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum algorithms for finding constant-sized sub-hypergraphs.
    Theor. Comput. Sci. 2016, Volume 609 (0) 2016
    Conference paper
    François Le Gall, Harumichi Nishimura, Seiichiro Tani.
    Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs.
    Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings 2014 (0) 2014
    Journal article
    François Le Gall, Harumichi Nishimura.
    Quantum Algorithms for Matrix Products over Semirings.
    Chicago J. Theor. Comput. Sci. 2017, Volume 2017 (0) 2017
    Conference paper
    François Le Gall, Harumichi Nishimura.
    Quantum Algorithms for Matrix Products over Semirings.
    Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings 2014 (0) 2014
    Journal article
    François Le Gall, Harumichi Nishimura.
    Quantum Algorithms for Matrix Products over Semirings.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Stacey Jeffery, François Le Gall.
    Quantum Communication Complexity of Distributed Set Joins.
    41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland 2016 (0) 2016
    Journal article
    Stacey Jeffery, François Le Gall.
    Quantum Communication Complexity of Distributed Set Joins.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    François Le Gall.
    Quantum Complexity of Boolean Matrix Multiplication and Related Problems.
    Computing with New Resources - Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday 2014 (0) 2014
    Journal article
    François Le Gall.
    Quantum Private Information Retrieval with Sublinear Communication Complexity
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    François Le Gall.
    Quantum Private Information Retrieval with Sublinear Communication Complexity.
    Theory of Computing 2012, Volume 8 (0) 2012
    Journal article
    Yoshifumi Inui, François Le Gall.
    Quantum Property Testing of Group Solvability.
    Algorithmica 2011, Volume 59 (0) 2011
    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
    Yoshifumi Inui, François Le Gall.
    Quantum Property Testing of Group Solvability.
    CoRR 2007, Volume 0 (0) 2007
    Conference paper
    Akinori Kawachi, Kenichi Kawano, François Le Gall, Suguru Tamaki.
    Quantum Query Complexity of Unitary Operator Discrimination.
    Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings 2017 (0) 2017
    Conference paper
    François Le Gall.
    Quantum Weakly Nondeterministic Communication Complexity
    CoRR 2005, Volume 0 (0) 2005
    Journal article
    François Le Gall.
    Quantum weakly nondeterministic communication complexity.
    Theor. Comput. Sci. 2013, Volume 486 (0) 2013
    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
    Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita.
    Reconstructing Strings from Substrings with Quantum Queries
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita.
    Reconstructing Strings from Substrings with Quantum Queries.
    Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings 2012 (0) 2012
    Conference paper
    François Le Gall.
    Solving Laplacian Systems in Logarithmic Space.
    CoRR 2016, Volume 0 (0) 2016
    Journal article
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete.
    SIAM J. Comput. 2015, Volume 44 (0) 2015
    Conference paper
    Hirotada Kobayashi, François Le Gall, Harumichi Nishimura.
    Stronger methods of making quantum interactive proofs perfectly complete.
    Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013 2013 (0) 2013
    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
    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
    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
    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
    Taisuke Izumi, François Le Gall.
    Triangle Finding and Listing in CONGEST Networks.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Taisuke Izumi, François Le Gall.
    Triangle Finding and Listing in CONGEST Networks.
    Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017 2017 (0) 2017
    Show item 1 to 78 of 78  

    Your query returned 78 matches in the database.