François Le Gall

From MaRDI portal
Person:334914

Available identifiers

zbMath Open le-gall.francoisMaRDI QIDQ334914

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61262622024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61263422024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61474292024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61475752024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61878262024-01-15Paper
Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture2023-12-08Paper
Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture2023-09-06Paper
https://portal.mardi4nfdi.de/entity/Q61684762023-08-08Paper
Bounds on oblivious multiparty quantum communication complexity2023-07-26Paper
https://portal.mardi4nfdi.de/entity/Q61611522023-06-26Paper
Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems2023-04-28Paper
https://portal.mardi4nfdi.de/entity/Q58742942023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q50917722022-07-27Paper
https://portal.mardi4nfdi.de/entity/Q50892222022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50905002022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50051262021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50026442021-07-28Paper
Quantum speedup for the minimum Steiner tree problem2021-04-21Paper
On Distributed Listing of Cliques2021-03-15Paper
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model2021-01-20Paper
Barriers for rectangular matrix multiplication2020-03-05Paper
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks2019-09-19Paper
https://portal.mardi4nfdi.de/entity/Q57434912019-05-10Paper
Generalized Quantum Arthur--Merlin Games2019-05-07Paper
Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems2018-08-16Paper
https://portal.mardi4nfdi.de/entity/Q46379802018-05-03Paper
https://portal.mardi4nfdi.de/entity/Q46086172018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46079512018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q46018442018-01-24Paper
Quantum algorithm for triangle finding in sparse graphs2017-11-09Paper
Quantum query complexity of unitary operator discrimination2017-10-23Paper
Triangle Finding and Listing in CONGEST Networks2017-10-11Paper
Quantum Algorithms for Matrix Products over Semirings2017-09-26Paper
Stronger methods of making quantum interactive proofs perfectly complete2017-05-16Paper
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete2017-01-13Paper
Improving quantum query complexity of Boolean matrix multiplication using graph collision2016-11-01Paper
On the Group and Color Isomorphism Problems2016-09-27Paper
Quantum algorithm for triangle finding in sparse graphs2016-01-11Paper
Quantum algorithms for finding constant-sized sub-hypergraphs2015-12-11Paper
Powers of tensors and fast matrix multiplication2015-11-11Paper
Quantum Complexity of Boolean Matrix Multiplication and Related Problems2015-09-08Paper
Fast Matrix Multiplication2015-08-21Paper
Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs2014-09-26Paper
Quantum Algorithms for Matrix Products over Semirings2014-09-02Paper
https://portal.mardi4nfdi.de/entity/Q54145952014-05-06Paper
Quantum weakly nondeterministic communication complexity2013-12-11Paper
Property testing for cyclic groups and beyond2013-12-09Paper
Improving quantum query complexity of Boolean matrix multiplication using graph collision2013-08-12Paper
A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication2013-03-21Paper
Quantum Private Information Retrieval with Sublinear Communication Complexity2012-09-27Paper
https://portal.mardi4nfdi.de/entity/Q29067892012-09-05Paper
Reconstructing Strings from Substrings with Quantum Queries2012-08-14Paper
On the distance between non-isomorphic groups.2012-05-04Paper
https://portal.mardi4nfdi.de/entity/Q53900132012-04-24Paper
An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem2012-01-23Paper
https://portal.mardi4nfdi.de/entity/Q31724242011-10-05Paper
Property testing for cyclic groups and beyond2011-08-17Paper
Quantum property testing of group solvability2011-03-02Paper
Exponential separation of quantum and classical online space complexity2009-10-19Paper
General Scheme for Perfect Quantum Network Coding with Free Classical Communication2009-07-14Paper
https://portal.mardi4nfdi.de/entity/Q35226412008-09-03Paper
Quantum property testing of group solvability2008-04-15Paper
Quantum Weakly Nondeterministic Communication Complexity2007-09-05Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: François Le Gall