Frédéric Magniez

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model.
CoRR, 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

Optimal Parallel Quantum Query Algorithms.
Algorithmica, 2017

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

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

Streaming Communication Protocols.
Electronic Colloquium on Computational Complexity (ECCC), 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

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

2015
Streaming Property Testing of Visibly Pushdown Languages.
Electronic Colloquium on Computational Complexity (ECCC), 2015

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

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

2013
Validating XML documents in the streaming model with external memory.
ACM Trans. Database Syst., 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

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
Streaming Complexity of Checking Priority Queues.
Electronic Colloquium on Computational Complexity (ECCC), 2012

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

On the Hitting Times of Quantum Versus Random Walks.
Algorithmica, 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
Search via Quantum Walk.
SIAM J. Comput., 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

2010
Approximate Satisfiability and Equivalence.
SIAM J. Comput., 2010

Improved bounds for the randomized decision tree complexity of recursive majority.
Electronic Colloquium on Computational Complexity (ECCC), 2010

The Streaming Complexity of Validating XML Documents
CoRR, 2010

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

2009
Quantum Testers for Hidden Group Properties.
Fundam. Inform., 2009

Recognizing well-parenthesized expressions in the streaming model.
Electronic Colloquium on Computational Complexity (ECCC), 2009

Foreword from the Guest Editors.
Algorithmica, 2009

2008
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.
SIAM J. Comput., 2008

2007
Probabilistic abstraction for model checking: An approach based on property testing.
ACM Trans. Comput. Log., 2007

Quantum Algorithms for the Triangle Problem.
SIAM J. Comput., 2007

Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates.
SIAM J. Comput., 2007

Property Testing of Regular Tree Languages.
Algorithmica, 2007

Quantum Complexity of Testing Group Commutativity.
Algorithmica, 2007

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

2005
Quantum Algorithms for Element Distinctness.
SIAM J. Comput., 2005

Multi-Linearity Self-Testing with Relative Error.
Theory Comput. Syst., 2005

2004
Property and Equivalence Testing on Strings
Electronic Colloquium on Computational Complexity (ECCC), 2004

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

Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem.
Int. J. Found. Comput. Sci., 2003

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

2001
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Electronic Colloquium on Computational Complexity (ECCC), 2001

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


  Loading...