Francois Le Gall
Francois Le Gall
Nagoya University
Bestätigte E-Mail-Adresse bei math.nagoya-u.ac.jp - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Powers of tensors and fast matrix multiplication
F Le Gall
Proceedings of the 39th international symposium on symbolic and algebraic …, 2014
10332014
Faster algorithms for rectangular matrix multiplication
F Le Gall
2012 IEEE 53rd annual symposium on foundations of computer science, 514-523, 2012
1502012
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
802018
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
712010
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
712009
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
50*2015
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
48*2007
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
462011
Quantum network coding for quantum repeaters
T Satoh, F Le Gall, H Imai
Physical Review A 86 (3), 032331, 2012
452012
Exponential separation of quantum and classical online space complexity
F Le Gall
Theory of Computing Systems 45 (2), 188-202, 2009
452009
Improved quantum algorithm for triangle finding via combinatorial arguments
F Le Gall
Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer …, 2014
352014
Triangle finding and listing in CONGEST networks
T Izumi, F Le Gall
Proceedings of the 36th ACM Symposium on Principles of Distributed Computing …, 2017
342017
NP-hardness of decoding quantum error-correction codes
MH Hsieh, F Le Gall
Physical Review A 83 (5), 052331, 2011
332011
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
252016
Efficient isomorphism testing for a class of group extensions
F Le Gall
Proceedings of the 26th International Symposium on Theoretical Aspects of …, 2009
252009
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
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
22*2016
Stronger methods of making quantum interactive proofs perfectly complete
H Kobayashi, F Le Gall, H Nishimura
SIAM Journal on Computing 44 (2), 243-289, 2015
212015
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
F Le Gall
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete …, 2012
142012
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
132018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20