Frédéric Magniez

Stacey Jeffery, Robin Kothari, Frédéric Magniez: Nested Quantum Walks with Quantum Data Structures. SODA 2013: 1474-1485

Troy Lee, Frédéric Magniez, Miklos Santha: Improved quantum query algorithms for triangle finding and associativity testing. SODA 2013: 1486-1502

Nathanaël François, Frédéric Magniez: Streaming Complexity of Checking Priority Queues. STACS 2013: 454-465

Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez: A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates. CoRR abs/1302.7316 (2013)

Marie-Claude Gaudel, Richard Lassaigne, Frédéric Magniez, Michel de Rougemont: Some approximations in Model Checking and Testing. CoRR abs/1304.5199 (2013)

Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha: On the Hitting Times of Quantum Versus Random Walks. Algorithmica 63(1-2): 91-116 (2012)

Christian Konrad, Frédéric Magniez, Claire Mathieu: Maximum Matching in Semi-streaming with Few Passes. APPROX-RANDOM 2012: 231-242

Stacey Jeffery, Robin Kothari, Frédéric Magniez: Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. ICALP (1) 2012: 522-532

Christian Konrad, Frédéric Magniez: Validating XML documents in the streaming model with external memory. ICDT 2012: 34-45

Nathanaël François, Frédéric Magniez: Streaming Complexity of Checking Priority Queues. CoRR abs/1209.4971 (2012)

Nathanaël François, Frédéric Magniez: Streaming Complexity of Checking Priority Queues. Electronic Colloquium on Computational Complexity (ECCC) 19: 128 (2012)

Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha: Search via Quantum Walk. SIAM J. Comput. 40(1): 142-164 (2011)

Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao: Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. ICALP (1) 2011: 317-329

Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun: The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays. WINE 2011: 266-277

Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun: The complexity of approximate Nash equilibrium in congestion games with negative delays. CoRR abs/1102.1161 (2011)

Troy Lee, Frédéric Magniez, Miklos Santha: A learning graph based quantum query algorithm for finding constant-size subgraphs. CoRR abs/1109.5135 (2011)

Christian Konrad, Frédéric Magniez, Claire Mathieu: Maximum Matching in Semi-Streaming with Few Passes. CoRR abs/1112.0184 (2011)

Eldar Fischer, Frédéric Magniez, Michel de Rougemont: Approximate Satisfiability and Equivalence. SIAM J. Comput. 39(6): 2251-2281 (2010)

Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland: Finding Is as Easy as Detecting for Quantum Walks. ICALP (1) 2010: 540-551

Frédéric Magniez, Claire Mathieu, Ashwin Nayak: Recognizing well-parenthesized expressions in the streaming model. STOC 2010: 261-270

Christian Konrad, Frédéric Magniez: The Streaming Complexity of Validating XML Documents. CoRR abs/1012.3311 (2010)

Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao: Improved bounds for the randomized decision tree complexity of recursive majority. Electronic Colloquium on Computational Complexity (ECCC) 17: 192 (2010)

Frédéric Magniez, Ashwin Nayak: Foreword from the Guest Editors. Algorithmica 55(3): 393-394 (2009)

Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen: Quantum Testers for Hidden Group Properties. Fundam. Inform. 91(2): 325-340 (2009)

Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha: On the hitting times of quantum versus random walks. SODA 2009: 86-95

Frédéric Magniez, Claire Mathieu, Ashwin Nayak: Recognizing well-parenthesized expressions in the streaming model. CoRR abs/0911.3291 (2009)

Frédéric Magniez, Claire Mathieu, Ashwin Nayak: Recognizing well-parenthesized expressions in the streaming model. Electronic Colloquium on Computational Complexity (ECCC) 16: 119 (2009)

Sophie Laplante, Frédéric Magniez: Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. SIAM J. Comput. 38(1): 46-62 (2008)

Frédéric Magniez, Ashwin Nayak: Quantum Complexity of Testing Group Commutativity. Algorithmica 48(3): 221-232 (2007)

Frédéric Magniez, Michel de Rougemont: Property Testing of Regular Tree Languages. Algorithmica 49(2): 127-146 (2007)

Frédéric Magniez, Miklos Santha, Mario Szegedy: Quantum Algorithms for the Triangle Problem. SIAM J. Comput. 37(2): 413-424 (2007)

Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha: Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. SIAM J. Comput. 37(2): 611-629 (2007)

Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont: Probabilistic abstraction for model checking: An approach based on property testing. ACM Trans. Comput. Log. 8(4) (2007)

Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha: Search via quantum walk. STOC 2007: 575-584

Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier: Self-testing of Quantum Circuits. ICALP (1) 2006: 72-83

Eldar Fischer, Frédéric Magniez, Michel de Rougemont: Approximate Satisfiability and Equivalence. LICS 2006: 421-430

Frédéric Magniez: Multi-Linearity Self-Testing with Relative Error. Theory Comput. Syst. 38(5): 573-591 (2005)

Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf: Quantum Algorithms for Element Distinctness. SIAM J. Comput. 34(6): 1324-1330 (2005)

Frédéric Magniez, Ashwin Nayak: Quantum Complexity of Testing Group Commutativity. ICALP 2005: 1312-1324

Frédéric Magniez, Miklos Santha, Mario Szegedy: Quantum algorithms for the triangle problem. SODA 2005: 1109-1117

Sophie Laplante, Frédéric Magniez: Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. IEEE Conference on Computational Complexity 2004: 294-304

Frédéric Magniez, Michel de Rougemont: Property Testing of Regular Tree Languages. ICALP 2004: 932-944

Eldar Fischer, Frédéric Magniez, Michel de Rougemont: Property and Equivalence Testing on Strings. Electronic Colloquium on Computational Complexity (ECCC)(096) (2004)

Gábor Ivanyos, Frédéric Magniez, Miklos Santha: Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem. Int. J. Found. Comput. Sci. 14(5): 723-740 (2003)

Marcos A. Kiwi, Frédéric Magniez, Miklos Santha: Approximate testing with error relative to input size. J. Comput. Syst. Sci. 66(2): 371-392 (2003)

Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen: Quantum Testers for Hidden Group Properties. MFCS 2003: 419-428

Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen: Hidden translation and orbit coset in quantum computing. STOC 2003: 1-9

Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont: Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. LICS 2002: 30-39

Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf: Quantum Algorithms for Element Distinctness. IEEE Conference on Computational Complexity 2001: 131-137

Gábor Ivanyos, Frédéric Magniez, Miklos Santha: Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. SPAA 2001: 263-270

Marcos A. Kiwi, Frédéric Magniez, Miklos Santha: Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey. Electronic Colloquium on Computational Complexity (ECCC) 8(14) (2001)

Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont: Probabilistic abstraction for model checking: An approach based on property testing. Electronic Colloquium on Computational Complexity (ECCC) 8(51) (2001)

Marcos A. Kiwi, Frédéric Magniez, Miklos Santha: Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey. Theoretical Aspects of Computer Science 2000: 30-83

Frédéric Magniez: Multi-linearity Self-Testing with Relative Error. STACS 2000: 302-313

Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha: Self-testing of universal and fault-tolerant sets of quantum gates. STOC 2000: 688-696

Marcos A. Kiwi, Frédéric Magniez, Miklos Santha: Approximate Testing with Relative Error. STOC 1999: 51-60

Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha: Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. CoRR quant-ph/9904108 (1999)