Follow
François Le Gall
François Le Gall
Graduate School of Mathematics, Nagoya University
Verified email at math.nagoya-u.ac.jp - Homepage
Title
Cited by
Cited by
Year
Powers of tensors and fast matrix multiplication
F Le Gall
Proceedings of the 39th international symposium on symbolic and algebraic …, 2014
12342014
Faster algorithms for rectangular matrix multiplication
F Le Gall
2012 IEEE 53rd annual symposium on foundations of computer science, 514-523, 2012
1762012
Improved rectangular matrix multiplication using powers of the coppersmith-winograd tensor
F Le Gall, F Urrutia
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
1362018
Perfect quantum network communication protocol based on classical network coding
H Kobayashi, F Le Gall, H Nishimura, M Rötteler
2010 IEEE International Symposium on Information Theory, 2686-2690, 2010
752010
General scheme for perfect quantum network coding with free classical communication
H Kobayashi, F Le Gall, H Nishimura, M Rötteler
International Colloquium on Automata, Languages, and Programming, 622-633, 2009
752009
Fast matrix multiplication: limitations of the Coppersmith-Winograd method
A Ambainis, Y Filmus, F Le Gall
Proceedings of the forty-seventh annual acm symposium on theory of computing …, 2015
702015
Quantum network coding for quantum repeaters
T Satoh, F Le Gall, H Imai
Physical Review A 86 (3), 032331, 2012
602012
Exponential separation of quantum and classical online space complexity
F Le Gall
Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006
552006
NP-hardness of decoding quantum error-correction codes
MH Hsieh, F Le Gall
Physical Review A 83 (5), 052331, 2011
532011
Constructing quantum network coding schemes from classical nonlinear protocols
H Kobayashi, F Le Gall, H Nishimura, M Rötteler
2011 IEEE International Symposium on Information Theory Proceedings, 109-113, 2011
522011
Efficient quantum algorithms for the hidden subgroup problem over a class of semi-direct product groups
Y Inui, F Le Gall
Quantum Information and Computation 7 (5&6), 559-570, 2007
52*2007
Triangle finding and listing in CONGEST networks
T Izumi, F Le Gall
Proceedings of the 36th ACM Symposium on Principles of Distributed Computing …, 2017
472017
Improved quantum algorithm for triangle finding via combinatorial arguments
F Le Gall
Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer …, 2014
452014
Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
F Le Gall
International Symposium on Distributed Computing, 57-70, 2016
402016
Efficient isomorphism testing for a class of group extensions
F Le Gall
Proceedings of the 26th International Symposium on Theoretical Aspects of …, 2009
262009
Improving quantum query complexity of Boolean matrix multiplication using graph collision
S Jeffery, R Kothari, F Le Gall, F Magniez
Algorithmica 76 (1), 1-16, 2016
24*2016
On QMA protocols with two short quantum proofs
F Le Gall, S Nakagawa, H Nishimura
Quantum Information and Computation 12 (7&8), 589-600, 2012
232012
Stronger methods of making quantum interactive proofs perfectly complete
H Kobayashi, F Le Gall, H Nishimura
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
202013
Quantum-inspired classical algorithms for singular value transformation
D Jethwani, F Le Gall, SK Singh
Proceedings of the 45th International Symposium on Mathematical Foundations …, 2020
192020
Average-case quantum advantage with shallow circuits
F Le Gall
Proceedings of the 34th Computational Complexity Conference (CCC 2019), 21:1 …, 2019
192019
The system can't perform the operation now. Try again later.
Articles 1–20