Frédéric Magniez
22
Documents
Presentation
Former student of the *Ecole Normale Supérieure de Cachan*, Frédéric Magniez is graduated both in mathematics (*agrégation*) and computer science (PhD). His PhD thesis was awarded by the *Association Française d’Informatique Théorique* in 2000. He then became a CNRS researcher and worked at the *Université Paris Sud*, before joining the *Institut de Recherche en Informatique Fondamentale* (IRIF) at the *Université Paris Cité* in 2010. His research focuses on the design and analysis of randomized algorithms for processing large data sets, as well as the development of quantum computing, particularly algorithms, cryptography and its interactions with physics.
Professor at the *École Polytechnique* from 2003 to 2015, Frédéric Magniez co-initiated the first course dedicated to quantum computing of the institution. In 2006, he founded and led the national working group for quantum computing, that currently brings together 20 research groups. From 2013 to 2017, he ran the Algorithms and Complexity group, whose research in algorithmics and quantum computing is recognized worldwide. In 2015, he became Deputy Director of the *Fondation des Sciences Mathématiques de Paris*, before taking over as Director of IRIF in 2018 until 2022. Professor at the *Collège de France* from 2020 to 2021, holder of the Annual Chair in Informatics and Digital Sciences, he taught quantum algorithms.
Publications
Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs16th Conference on the Theory of Quantum Computation, Communication and Cryptography, Jul 2021, Riga, Latvia. ⟨10.4230/LIPIcs.TQC.2021.1⟩
Conference papers
hal-03024755v1
|
|
Quantum Distributed Complexity of Set Disjointness on a Line47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Jul 2020, Saarbrücken, Germany. pp.82:1--82:18, ⟨10.4230/LIPIcs.ICALP.2020.82⟩
Conference papers
hal-03024619v1
|
|
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Mar 2020, Montpellier, France. pp.23:1--23:13, ⟨10.4230/LIPIcs.STACS.2020.23⟩
Conference papers
hal-02349998v1
|
|
Quantum Chebyshev's Inequality and Applications46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Jul 2019, Patras, Greece. ⟨10.4230/LIPIcs.ICALP.2019.69⟩
Conference papers
hal-02349991v1
|
|
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks22nd Annual Conference on Quantum Information Processing (QIP 2019), Jan 2019, Boulder, United States
Conference papers
hal-02351393v1
|
|
Improved bounds for testing Dyck languagesTwenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), Jan 2018, New Orleans, United States. ⟨10.1137/1.9781611975031.100⟩
Conference papers
hal-02349997v1
|
|
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks2018 ACM Symposium on Principles of Distributed Computing (PODC 2018), Jul 2018, Egham, France. pp.337-346, ⟨10.1145/3212734.3212744⟩
Conference papers
hal-02349996v1
|
|
Streaming Communication Protocols44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), 2017, Warsaw, Poland. ⟨10.4230/LIPIcs.ICALP.2017.130⟩
Conference papers
hal-03815391v1
|
|
Extended Learning Graphs for Triangle FindingSTACS, 2017, Hannover, France. ⟨10.4230/LIPIcs.STACS.2017.20⟩
Conference papers
hal-02107535v1
|
|
Stable Matching with Evolving PreferencesApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2016, Paris, France. ⟨10.4230/LIPIcs.APPROX-RANDOM.2016.36⟩
Conference papers
hal-03753551v1
|
|
|
Streaming Property Testing of Visibly Pushdown Languages *24th Annual European Symposium on Algorithms (ESA 2016), Aug 2016, Aarhus, Denmark. pp.17, ⟨10.4230/LIPIcs.ESA.2016.43⟩
Conference papers
hal-01362276v1
|
Algorithmes quantiquesCollège de France / Fayard, 2021, Leçons inaugurales du Collège de France, 978-2-213-72130-9
Books
hal-03753516v1
|