Seguir
François Le Gall
François Le Gall
Graduate School of Mathematics, Nagoya University
Dirección de correo verificada de math.nagoya-u.ac.jp - Página principal
Título
Citado por
Citado por
Año
Powers of tensors and fast matrix multiplication
F Le Gall
Proceedings of the 39th international symposium on symbolic and algebraic …, 2014
13722014
Faster algorithms for rectangular matrix multiplication
F Le Gall
2012 IEEE 53rd annual symposium on foundations of computer science, 514-523, 2012
2012012
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
1892018
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
822009
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
812010
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
782015
Quantum network coding for quantum repeaters
T Satoh, F Le Gall, H Imai
Physical Review A 86 (3), 032331, 2012
722012
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
622006
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
Triangle finding and listing in CONGEST networks
T Izumi, F Le Gall
Proceedings of the 36th ACM Symposium on Principles of Distributed Computing …, 2017
532017
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
532007
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
382022
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
332018
Efficient isomorphism testing for a class of group extensions
F Le Gall
Proceedings of the 26th International Symposium on Theoretical Aspects of …, 2009
332009
Quantum meets fine-grained complexity: Sublinear time quantum algorithms for string problems
F Le Gall, S Seddighin
Algorithmica 85 (5), 1251-1286, 2023
322023
Quantum advantage for the LOCAL model in distributed computing
FL Gall, H Nishimura, A Rosmanis
Proceedings of the 36th International Symposium on Theoretical Aspects of …, 2019
312019
Quantum distributed algorithm for triangle finding in the CONGEST model
T Izumi, F Le Gall, F Magniez
Proceedings of the 37th International Symposium on Theoretical Aspects of …, 2019
292019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20