| 2026 | MFCS | Multi-Prover Interactive Proof Systems with Leakage. | Vahid R. Asadi, Atsuya Hasegawa, Franois Le Gall |
| 2026 | MFCS | A Slightly Improved Upper Bound for Quantum Statistical Zero-Knowledge. | Franois Le Gall, Yupan Liu, Qisheng Wang |
| 2026 | PODC | Brief Announcement: Exponential Quantum Advantage for Message Complexity in Distributed Algorithms. | Franois Le Gall, Mal Luce, Joseph Marchand, Mathieu Roget |
| 2025 | ESA | Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians. | Franois Le Gall |
| 2025 | FOCS | Group Order is in QCMA. | Franois Le Gall, Harumichi Nishimura, Dhara Thakkar |
| 2025 | STOC | Online Locality Meets Distributed Quantum Computing. | Amirreza Akbari, Xavier Coiteux-Roy, Francesco d'Amore, Franois Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, Vclav Rozhon, Jukka Suomela |
| 2025 | STOC | Distributed Quantum Advantage for Local Problems. | Alkida Balliu, Sebastian Brandt, Xavier Coiteux-Roy, Francesco d'Amore, Massimo Equi, Franois Le Gall, Henrik Lievonen, Augusto Modanese, Dennis Olivetti, Marc-Olivier Renou, Jukka Suomela, Lucas Tendick, Isadora Veeren |
| 2024 | OPODIS | Quantum Simultaneous Protocols Without Public Coins Using Modified Equality Queries. | Franois Le Gall, Oran Nadler, Harumichi Nishimura, Rotem Oshman |
| 2024 | SODA | Faster Rectangular Matrix Multiplication by Combination Loss Analysis. | Franois Le Gall |
| 2024 | STOC | No Distributed Quantum Advantage for Approximate Graph Coloring. | Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, Franois Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela |
| 2023 | ICALP | Improved Hardness Results for the Guided Local Hamiltonian Problem. | Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, Franois Le Gall, Tomoyuki Morimae, Jordi Weggemans |
| 2023 | MFCS | Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. | Franois Le Gall, Masayuki Miyamoto, Harumichi Nishimura |
| 2023 | OPODIS | Quantum Distributed Computing: Potential and Limitations (Invited Talk). | Franois Le Gall |
| 2023 | STACS | Distributed Quantum Interactive Proofs. | Franois Le Gall, Masayuki Miyamoto, Harumichi Nishimura |
| 2022 | ISAAC | An Optimal Oracle Separation of Classical and Quantum Hybrid Schemes. | Atsuya Hasegawa, Franois Le Gall |
| 2022 | LATIN | Bounds on Oblivious Multiparty Quantum Communication Complexity. | Franois Le Gall, Daiki Suruga |
| 2022 | STOC | Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture. | Sevag Gharibian, Franois Le Gall |
| 2021 | ISAAC | Lower Bounds for Induced Cycle Detection in Distributed Computing. | Franois Le Gall, Masayuki Miyamoto |
| 2021 | ISAAC | Quantum Advantage with Shallow Circuits Under Arbitrary Corruption. | Atsuya Hasegawa, Franois Le Gall |
| 2021 | MFCS | Test of Quantumness with Small-Depth Quantum Circuits. | Shuichi Hirahara, Franois Le Gall |
| 2021 | SODA | Tight Distributed Listing of Cliques. | Keren Censor-Hillel, Yi-Jun Chang, Franois Le Gall, Dean Leitersdorf |
| 2020 | COCOON | Quantum Speedup for the Minimum Steiner Tree Problem. | Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise, Franois Le Gall |
| 2020 | MFCS | Quantum-Inspired Classical Algorithms for Singular Value Transformation. | Dhawal Jethwani, Franois Le Gall, Sanjay Kumar Singh |
| 2020 | PODC | On Distributed Listing of Cliques. | Keren Censor-Hillel, Franois Le Gall, Dean Leitersdorf |
| 2020 | STACS | Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. | Taisuke Izumi, Franois Le Gall, Frdric Magniez |
| 2019 | PODC | Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model. | Taisuke Izumi, Franois Le Gall |
| 2019 | STACS | Quantum Advantage for the LOCAL Model in Distributed Computing. | Franois Le Gall, Harumichi Nishimura, Ansis Rosmanis |
| 2018 | MFCS | Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups. | Franois Le Gall, Tomoyuki Morimae, Harumichi Nishimura, Yuki Takeuchi |
| 2018 | PODC | Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. | Franois Le Gall, Frdric Magniez |
| 2017 | COCOON | Quantum Query Complexity of Unitary Operator Discrimination. | Akinori Kawachi, Kenichi Kawano, Franois Le Gall, Suguru Tamaki |
| 2017 | PODC | Triangle Finding and Listing in CONGEST Networks. | Taisuke Izumi, Franois Le Gall |
| 2016 | MFCS | Quantum Communication Complexity of Distributed Set Joins. | Stacey Jeffery, Franois Le Gall |
| 2015 | ISAAC | Quantum Algorithm for Triangle Finding in Sparse Graphs. | Franois Le Gall, Shogo Nakajima |
| 2015 | STOC | Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method. | Andris Ambainis, Yuval Filmus, Franois Le Gall |
| 2014 | COCOON | Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs. | Franois Le Gall, Harumichi Nishimura, Seiichiro Tani |
| 2014 | FOCS | Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments. | Franois Le Gall |
| 2014 | ISSAC | Algebraic complexity theory and matrix multiplication. | Franois Le Gall |
| 2014 | ISSAC | Powers of tensors and fast matrix multiplication. | Franois Le Gall |
| 2012 | FOCS | Faster Algorithms for Rectangular Matrix Multiplication. | Franois Le Gall |
| 2012 | ISAAC | A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication. | Franois Le Gall |
| 2012 | SODA | Improved output-sensitive quantum algorithms for Boolean matrix multiplication. | Franois Le Gall |
| 2011 | COCOON | Property Testing for Cyclic Groups and Beyond. | Franois Le Gall, Yuichi Yoshida |
| 2010 | ISIT | Perfect quantum network communication protocol based on classical network coding. | Hirotada Kobayashi, Franois Le Gall, Harumichi Nishimura, Martin Rtteler |
| 2010 | STACS | An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem. | Franois Le Gall |
| 2009 | ICALP | General Scheme for Perfect Quantum Network Coding with Free Classical Communication. | Hirotada Kobayashi, Franois Le Gall, Harumichi Nishimura, Martin Rtteler |
| 2009 | STACS | Efficient Isomorphism Testing for a Class of Group Extensions. | Franois Le Gall |
| 2008 | LATIN | Quantum Property Testing of Group Solvability. | Yoshifumi Inui, Franois Le Gall |
| 2006 | MFCS | Quantum Weakly Nondeterministic Communication Complexity. | Franois Le Gall |
| 2006 | SPAA | Exponential separation of quantum and classical online space complexity. | Franois Le Gall |