Frédéric Magniez

Orcid: 0000-0003-2384-9026

According to our database1, Frédéric Magniez authored at least 59 papers between 1999 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Quantum Communication Advantage for Leader Election and Agreement.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Deterministic Even-Cycle Detection in Broadcast CONGEST.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Quantum Property Testing in Sparse Directed Graphs.
Proceedings of the Approximation, 2025

2024
Even-Cycle Detection in the Randomized and Quantum CONGEST Model.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2021
Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs.
Proceedings of the 16th Conference on the Theory of Quantum Computation, 2021

2020
Quantum Time-Space Tradeoffs by Recording Queries.
CoRR, 2020

Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Quantum Distributed Complexity of Set Disjointness on a Line.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Quantum Chebyshev's Inequality and Applications.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Improved bounds for testing Dyck languages.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing.
Algorithmica, 2017

Extended Learning Graphs for Triangle Finding.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Streaming Communication Protocols.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Improved bounds for the randomized decision tree Complexity of recursive majority.
Random Struct. Algorithms, 2016

Quantum Walks Can Find a Marked Element on Any Graph.
Algorithmica, 2016

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision.
Algorithmica, 2016

Streaming Property Testing of Visibly Pushdown Languages.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Stable Matching with Evolving Preferences.
Proceedings of the Approximation, 2016

2014
Hidden Translation and Translating Coset in Quantum Computing.
SIAM J. Comput., 2014

Optimal Parallel Quantum Query Algorithms.
Proceedings of the Algorithms - ESA 2014, 2014

Unidirectional Input/Output Streaming Complexity of Reversal and Sorting.
Proceedings of the Approximation, 2014

2013
Some approximations in Model Checking and Testing
CoRR, 2013

A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
CoRR, 2013

Input/Output Streaming Complexity of Reversal and Sorting.
CoRR, 2013

Streaming Complexity of Checking Priority Queues.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Improved quantum query algorithms for triangle finding and associativity testing.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Nested Quantum Walks with Quantum Data Structures.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Time-Efficient Quantum Walks for 3-Distinctness.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Learning graph based quantum query algorithms for finding constant-size subgraphs.
Chic. J. Theor. Comput. Sci., 2012

Validating XML documents in the streaming model with external memory.
Proceedings of the 15th International Conference on Database Theory, 2012

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Maximum Matching in Semi-streaming with Few Passes.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
A learning graph based quantum query algorithm for finding constant-size subgraphs
CoRR, 2011

The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
The Streaming Complexity of Validating XML Documents
CoRR, 2010

Recognizing well-parenthesized expressions in the streaming model.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Finding Is as Easy as Detecting for Quantum Walks.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Foreword from the Guest Editors.
Algorithmica, 2009

On the hitting times of quantum versus random walks.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2007
Search via quantum walk.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Approximate Satisfiability and Equivalence.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Self-testing of Quantum Circuits.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Quantum algorithms for the triangle problem.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Quantum Complexity of Testing Group Commutativity.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Property and Equivalence Testing on Strings
Electron. Colloquium Comput. Complex., 2004

Property Testing of Regular Tree Languages.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003
Approximate testing with error relative to input size.
J. Comput. Syst. Sci., 2003

Hidden translation and orbit coset in quantum computing.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Quantum Testers for Hidden Group Properties.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Quantum Algorithms for Element Distinctness.
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000
Self-testing of universal and fault-tolerant sets of quantum gates.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Multi-linearity Self-Testing with Relative Error.
Proceedings of the STACS 2000, 2000

Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey.
Proceedings of the Theoretical Aspects of Computer Science, 2000

1999
Approximate Testing with Relative Error.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999


  Loading...