The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Frédéric Magniez: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
    Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey. [Citation Graph (0, 0)][DBLP]
    Theoretical Aspects of Computer Science, 2000, pp:30-83 [Conf]
  2. Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
    Quantum Algorithms for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:131-137 [Conf]
  3. Sophie Laplante, Frédéric Magniez
    Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:294-304 [Conf]
  4. Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier
    Self-testing of Quantum Circuits. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:72-83 [Conf]
  5. Frédéric Magniez, Ashwin Nayak
    Quantum Complexity of Testing Group Commutativity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1312-1324 [Conf]
  6. Frédéric Magniez, Michel de Rougemont
    Property Testing of Regular Tree Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:932-944 [Conf]
  7. Eldar Fischer, Frédéric Magniez, Michel de Rougemont
    Approximate Satisfiability and Equivalence. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:421-430 [Conf]
  8. Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont
    Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:30-39 [Conf]
  9. Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen
    Quantum Testers for Hidden Group Properties. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:419-428 [Conf]
  10. Frédéric Magniez, Miklos Santha, Mario Szegedy
    Quantum algorithms for the triangle problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1109-1117 [Conf]
  11. Gábor Ivanyos, Frédéric Magniez, Miklos Santha
    Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:263-270 [Conf]
  12. Frédéric Magniez
    Multi-linearity Self-Testing with Relative Error. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:302-313 [Conf]
  13. Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
    Self-testing of universal and fault-tolerant sets of quantum gates. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:688-696 [Conf]
  14. Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
    Hidden translation and orbit coset in quantum computing. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:1-9 [Conf]
  15. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
    Approximate Testing with Relative Error. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:51-60 [Conf]
  16. Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
    Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  17. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
    Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:14, pp:- [Journal]
  18. Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont
    Probabilistic abstraction for model checking: An approach based on property testing [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:51, pp:- [Journal]
  19. Eldar Fischer, Frédéric Magniez, Michel de Rougemont
    Property and Equivalence Testing on Strings [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:096, pp:- [Journal]
  20. Gábor Ivanyos, Frédéric Magniez, Miklos Santha
    Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:5, pp:723-740 [Journal]
  21. Marcos A. Kiwi, Frédéric Magniez, Miklos Santha
    Approximate testing with error relative to input size. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:2, pp:371-392 [Journal]
  22. Frédéric Magniez
    Multi-Linearity Self-Testing with Relative Error. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:5, pp:573-591 [Journal]
  23. Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf
    Quantum Algorithms for Element Distinctness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:6, pp:1324-1330 [Journal]
  24. Frédéric Magniez, Miklos Santha, Mario Szegedy
    Quantum Algorithms for the Triangle Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:413-424 [Journal]
  25. Frédéric Magniez, Ashwin Nayak, Jeremie Roland, Miklos Santha
    Search via quantum walk. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:575-584 [Conf]
  26. Frédéric Magniez, Ashwin Nayak
    Quantum Complexity of Testing Group Commutativity. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:3, pp:221-232 [Journal]
  27. Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha
    Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:2, pp:611-629 [Journal]
  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. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:4, pp:- [Journal]

  29. Finding Is as Easy as Detecting for Quantum Walks. [Citation Graph (, )][DBLP]


  30. On the hitting times of quantum versus random walks. [Citation Graph (, )][DBLP]


  31. Recognizing well-parenthesized expressions in the streaming model. [Citation Graph (, )][DBLP]


  32. Property Testing of Regular Tree Languages. [Citation Graph (, )][DBLP]


  33. Foreword from the Guest Editors. [Citation Graph (, )][DBLP]


  34. Recognizing well-parenthesized expressions in the streaming model [Citation Graph (, )][DBLP]


Search in 0.033secs, Finished in 0.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002