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
13602014
Faster algorithms for rectangular matrix multiplication
F Le Gall
2012 IEEE 53rd annual symposium on foundations of computer science, 514-523, 2012
1962012
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
1852018
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
912015
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
812009
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
792010
Quantum network coding for quantum repeaters
T Satoh, F Le Gall, H Imai
Physical Review A 86 (3), 032331, 2012
682012
NP-hardness of decoding quantum error-correction codes
MH Hsieh, F Le Gall
Physical Review A 83 (5), 052331, 2011
642011
Exponential separation of quantum and classical online space complexity
F Le Gall
Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006
612006
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
582011
Improved quantum algorithm for triangle finding via combinatorial arguments
F Le Gall
Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer …, 2014
562014
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
53*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
522017
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
422016
Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture
S Gharibian, F Le Gall
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
332022
Efficient isomorphism testing for a class of group extensions
F Le Gall
Proceedings of the 26th International Symposium on Theoretical Aspects of …, 2009
322009
Quantum meets fine-grained complexity: Sublinear time quantum algorithms for string problems
F Le Gall, S Seddighin
Algorithmica 85 (5), 1251-1286, 2023
302023
Sublinear-time quantum computation of the diameter in CONGEST networks
F Le Gall, F Magniez
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
282018
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
272012
Improving quantum query complexity of Boolean matrix multiplication using graph collision
S Jeffery, R Kothari, F Le Gall, F Magniez
Algorithmica 76, 1-16, 2016
26*2016
The system can't perform the operation now. Try again later.
Articles 1–20