François Le Gall
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2022
on a stage with
all 8 in the filters
who talks about the same things
- Rotem Oshman4 talks
- Keren Censor-Hillel2 talks
- Boaz Barak5 talks
- Oded Goldreich4 talks
- Omar Fawzi3 talks
- Yuval Filmus9 talks
| title | conference | date |
|---|---|---|
| Quantum Distributed Algorithms for Detection of Cliques | ITCS 2022 | 2022-01-31 |
Takes any classical distributed listing routine and converts it into a faster quantum detection routine by running nested Grover searches over carefully… | ||
| Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems | ITCS 2022 | 2022-01-31 |
Presents quantum algorithms for longest palindromic substring and longest common substring with concrete bounds: LPS solved in sqrt(n) time (with matching… | ||
| Distributed Quantum Proofs for Replicated Data | ITCS 2021 | 2021-01-06 |
Claim: replicated-data consistency can be certified with log N qubits per certificate and per message, versus Θ(N) classically. Construction uses quantum… | ||
| Powers of Tensors and Fast Matrix Multiplication | Tensors in Computer Science and Geometry 2014 | 2014-11-10 |
Claims a tiny improvement to the best known upper bound on the matrix multiplication exponent omega by applying the laser method (version 2.3) to high powers… | ||
| nothing matches | ||