 | 2009 |
| 33 |  | Frédéric Magniez,
Ashwin Nayak,
Peter C. Richter,
Miklos Santha:
On the hitting times of quantum versus random walks.
SODA 2009: 86-95 |
| 32 |  | Frédéric Magniez,
Ashwin Nayak:
Foreword from the Guest Editors.
Algorithmica 55(3): 393-394 (2009) |
| 31 |  | Katalin Friedl,
Miklos Santha,
Frédéric Magniez,
Pranab Sen:
Quantum Testers for Hidden Group Properties.
Fundam. Inform. 91(2): 325-340 (2009) |
| 2008 |
| 30 |  | 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) |
| 2007 |
| 29 |  | Frédéric Magniez,
Ashwin Nayak,
Jeremie Roland,
Miklos Santha:
Search via quantum walk.
STOC 2007: 575-584 |
| 28 |  | 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) |
| 27 |  | Frédéric Magniez,
Ashwin Nayak:
Quantum Complexity of Testing Group Commutativity.
Algorithmica 48(3): 221-232 (2007) |
| 26 |  | Frédéric Magniez,
Michel de Rougemont:
Property Testing of Regular Tree Languages.
Algorithmica 49(2): 127-146 (2007) |
| 25 |  | Frédéric Magniez,
Miklos Santha,
Mario Szegedy:
Quantum Algorithms for the Triangle Problem.
SIAM J. Comput. 37(2): 413-424 (2007) |
| 24 |  | 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) |
| 2006 |
| 23 |  | Frédéric Magniez,
Dominic Mayers,
Michele Mosca,
Harold Ollivier:
Self-testing of Quantum Circuits.
ICALP (1) 2006: 72-83 |
| 22 |  | Eldar Fischer,
Frédéric Magniez,
Michel de Rougemont:
Approximate Satisfiability and Equivalence.
LICS 2006: 421-430 |
| 2005 |
| 21 |  | Frédéric Magniez,
Ashwin Nayak:
Quantum Complexity of Testing Group Commutativity.
ICALP 2005: 1312-1324 |
| 20 |  | Frédéric Magniez,
Miklos Santha,
Mario Szegedy:
Quantum algorithms for the triangle problem.
SODA 2005: 1109-1117 |
| 19 |  | 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) |
| 18 |  | Frédéric Magniez:
Multi-Linearity Self-Testing with Relative Error.
Theory Comput. Syst. 38(5): 573-591 (2005) |
| 2004 |
| 17 |  | Frédéric Magniez,
Michel de Rougemont:
Property Testing of Regular Tree Languages.
ICALP 2004: 932-944 |
| 16 |  | 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 |
| 15 |  | Eldar Fischer,
Frédéric Magniez,
Michel de Rougemont:
Property and Equivalence Testing on Strings
Electronic Colloquium on Computational Complexity (ECCC)(096): (2004) |
| 2003 |
| 14 |  | Katalin Friedl,
Frédéric Magniez,
Miklos Santha,
Pranab Sen:
Quantum Testers for Hidden Group Properties.
MFCS 2003: 419-428 |
| 13 |  | 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 |
| 12 |  | 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) |
| 11 |  | 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) |
| 2002 |
| 10 |  | 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 |
| 2001 |
| 9 |  | 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 |
| 8 |  | 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 |
| 7 |  | 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) |
| 6 |  | 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) |
| 2000 |
| 5 |  | Frédéric Magniez:
Multi-linearity Self-Testing with Relative Error.
STACS 2000: 302-313 |
| 4 |  | 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 |
| 3 |  | 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 |
| 1999 |
| 2 |  | Marcos A. Kiwi,
Frédéric Magniez,
Miklos Santha:
Approximate Testing with Relative Error.
STOC 1999: 51-60 |
| 1 |  | 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) |