Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Frédéric
    Last name: Magniez
    DBLP: 72/3159
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 84 of 84  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Troy Lee, Frédéric Magniez, Miklos Santha.
    Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing.
    Algorithmica 2017, Volume 77 (0) 2017
    Conference paper
    Titouan Carette, Mathieu Laurière, Frédéric Magniez.
    Extended Learning Graphs for Triangle Finding.
    34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany 2017 (0) 2017
    Conference paper
    Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez.
    Streaming Communication Protocols.
    44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland 2017 (0) 2017
    Conference paper
    Stacey Jeffery, Frédéric Magniez, Ronald de Wolf.
    Optimal Parallel Quantum Query Algorithms.
    Algorithmica 2017, Volume 79 (0) 2017
    Conference paper
    Eldar Fischer, Frédéric Magniez, Tatiana A. Starikovskaya.
    Improved bounds for testing Dyck languages.
    CoRR 2017, Volume 0 (0) 2017
    Conference paper
    Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland.
    Quantum Walks Can Find a Marked Element on Any Graph.
    Algorithmica 2016, Volume 74 (0) 2016
    Journal article
    Stacey Jeffery, Robin Kothari, François Le Gall, Frédéric Magniez.
    Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision.
    Algorithmica 2016, Volume 76 (0) 2016
    Conference paper
    Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre.
    Streaming Property Testing of Visibly Pushdown Languages.
    24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark 2016 (0) 2016
    Conference paper
    Varun Kanade, Nikos Leonardos, Frédéric Magniez.
    Stable Matching with Evolving Preferences.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France 2016 (0) 2016
    Conference paper
    Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez.
    Streaming Communication Protocols.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Titouan Carette, Mathieu Laurière, Frédéric Magniez.
    Extended Learning Graphs for Triangle Finding.
    CoRR 2016, Volume 0 (0) 2016
    Conference paper
    Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez.
    Streaming Communication Protocols.
    Electronic Colloquium on Computational Complexity (ECCC) 2016, Volume 23 (0) 2016
    Conference paper
    Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao.
    Improved bounds for the randomized decision tree Complexity of recursive majority.
    Random Struct. Algorithms 2016, Volume 48 (0) 2016
    Conference paper
    Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre.
    Streaming Property Testing of Visibly Pushdown Languages.
    CoRR 2015, Volume 0 (0) 2015
    Conference paper
    Nathanaël François, Frédéric Magniez, Olivier Serre, Michel de Rougemont.
    Streaming Property Testing of Visibly Pushdown Languages.
    Electronic Colloquium on Computational Complexity (ECCC) 2015, Volume 22 (0) 2015
    Journal article
    Varun Kanade, Nikos Leonardos, Frédéric Magniez.
    Stable Matching with Evolving Preferences.
    CoRR 2015, Volume 0 (0) 2015
    Journal article
    Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen.
    Hidden Translation and Translating Coset in Quantum Computing.
    SIAM J. Comput. 2014, Volume 43 (0) 2014
    Conference paper
    Stacey Jeffery, Frédéric Magniez, Ronald de Wolf.
    Optimal Parallel Quantum Query Algorithms.
    Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Nathanaël François, Rahul Jain, Frédéric Magniez.
    Unidirectional Input/Output Streaming Complexity of Reversal and Sorting.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain 2014 (0) 2014
    Conference paper
    Frédéric Magniez, Claire Mathieu, Ashwin Nayak.
    Recognizing Well-Parenthesized Expressions in the Streaming Model.
    SIAM J. Comput. 2014, Volume 43 (0) 2014
    Journal article
    Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez.
    A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Nathanaël François, Frédéric Magniez.
    Streaming Complexity of Checking Priority Queues.
    30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany 2013 (0) 2013
    Journal article
    Marie-Claude Gaudel, Richard Lassaigne, Frédéric Magniez, Michel de Rougemont.
    Some approximations in Model Checking and Testing
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Stacey Jeffery, Robin Kothari, Frédéric Magniez.
    Nested Quantum Walks with Quantum Data Structures.
    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 (0) 2013
    Conference paper
    Troy Lee, Frédéric Magniez, Miklos Santha.
    Improved quantum query algorithms for triangle finding and associativity testing.
    Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013 2013 (0) 2013
    Conference paper
    Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez.
    Time-Efficient Quantum Walks for 3-Distinctness.
    Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I 2013 (0) 2013
    Journal article
    Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao.
    Improved bounds for the randomized decision tree complexity of recursive majority.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Nathanaël François, Frédéric Magniez.
    Input/Output Streaming Complexity of Reversal and Sorting.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Stacey Jeffery, Frédéric Magniez, Ronald de Wolf.
    Optimal parallel quantum query algorithms.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Christian Konrad, Frédéric Magniez.
    Validating XML documents in the streaming model with external memory.
    ACM Trans. Database Syst. 2013, Volume 38 (0) 2013
    Journal article
    Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha.
    On the Hitting Times of Quantum Versus Random Walks.
    Algorithmica 2012, Volume 63 (0) 2012
    Conference paper
    Christian Konrad, Frédéric Magniez.
    Validating XML documents in the streaming model with external memory.
    15th International Conference on Database Theory, ICDT '12, Berlin, Germany, March 26-29, 2012 2012 (0) 2012
    Conference paper
    Stacey Jeffery, Robin Kothari, Frédéric Magniez.
    Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012 (0) 2012
    Conference paper
    Christian Konrad, Frédéric Magniez, Claire Mathieu.
    Maximum Matching in Semi-streaming with Few Passes.
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings 2012 (0) 2012
    Journal article
    Nathanaël François, Frédéric Magniez.
    Streaming Complexity of Checking Priority Queues
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Nathanaël François, Frédéric Magniez.
    Streaming Complexity of Checking Priority Queues.
    Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19 (0) 2012
    Conference paper
    Troy Lee, Frédéric Magniez, Miklos Santha.
    Learning graph based quantum query algorithms for finding constant-size subgraphs.
    Chicago J. Theor. Comput. Sci. 2012, Volume 2012 (0) 2012
    Journal article
    Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun.
    The complexity of approximate Nash equilibrium in congestion games with negative delays
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha.
    Search via Quantum Walk.
    SIAM J. Comput. 2011, Volume 40 (0) 2011
    Conference paper
    Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao.
    Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority.
    Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I 2011 (0) 2011
    Journal article
    Troy Lee, Frédéric Magniez, Miklos Santha.
    A learning graph based quantum query algorithm for finding constant-size subgraphs
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun.
    The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays.
    Internet and Network Economics - 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011. Proceedings 2011 (0) 2011
    Conference paper
    Christian Konrad, Frédéric Magniez, Claire Mathieu.
    Maximum Matching in Semi-Streaming with Few Passes
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Eldar Fischer, Frédéric Magniez, Michel de Rougemont.
    Approximate Satisfiability and Equivalence.
    SIAM J. Comput. 2009, Volume 39 (0) 2010
    Conference paper
    Frédéric Magniez, Claire Mathieu, Ashwin Nayak.
    Recognizing well-parenthesized expressions in the streaming model.
    Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 2010 (0) 2010
    Conference paper
    Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland.
    Finding Is as Easy as Detecting for Quantum Walks.
    Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I 2010 (0) 2010
    Conference paper
    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) 2010, Volume 17 (0) 2010
    Journal article
    Christian Konrad, Frédéric Magniez.
    The Streaming Complexity of Validating XML Documents
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Frédéric Magniez, Claire Mathieu, Ashwin Nayak.
    Recognizing well-parenthesized expressions in the streaming model.
    Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16 (0) 2009
    Conference paper
    Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha.
    On the hitting times of quantum versus random walks.
    Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009 2009 (0) 2009
    Conference paper
    Frédéric Magniez, Ashwin Nayak.
    Foreword from the Guest Editors.
    Algorithmica 2009, Volume 55 (0) 2009
    Conference paper
    Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen.
    Quantum Testers for Hidden Group Properties.
    Fundam. Inform. 2009, Volume 91 (0) 2009
    Conference paper
    Frédéric Magniez, Claire Mathieu, Ashwin Nayak.
    Recognizing well-parenthesized expressions in the streaming model
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Sophie Laplante, Frédéric Magniez.
    Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.
    SIAM J. Comput. 2008, Volume 38 (0) 2008
    Conference paper
    Frédéric Magniez, Ashwin Nayak.
    Quantum Complexity of Testing Group Commutativity.
    Algorithmica 2007, Volume 48 (0) 2007
    Conference paper
    Frédéric Magniez, Michel de Rougemont.
    Property Testing of Regular Tree Languages.
    Algorithmica 2007, Volume 49 (0) 2007
    Conference paper
    Frédéric Magniez, Miklos Santha, Mario Szegedy.
    Quantum Algorithms for the Triangle Problem.
    SIAM J. Comput. 2007, Volume 37 (0) 2007
    Conference paper
    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. 2007, Volume 37 (0) 2007
    Conference paper
    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. 2007, Volume 8 (0) 2007
    Conference paper
    Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha.
    Search via quantum walk.
    Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007 2007 (0) 2007
    Conference paper
    Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha.
    Search via Quantum Walk.
    CoRR 2006, Volume 0 (0) 2006
    Conference paper
    Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier.
    Self-testing of Quantum Circuits.
    Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I 2006 (0) 2006
    Conference paper
    Eldar Fischer, Frédéric Magniez, Michel de Rougemont.
    Approximate Satisfiability and Equivalence.
    21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, WA, USA, Proceedings 2006 (0) 2006
    Conference paper
    Frédéric Magniez, Ashwin Nayak.
    Quantum Complexity of Testing Group Commutativity.
    Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Frédéric Magniez, Miklos Santha, Mario Szegedy.
    Quantum algorithms for the triangle problem.
    Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005 2005 (0) 2005
    Conference paper
    Frédéric Magniez.
    Multi-Linearity Self-Testing with Relative Error.
    Theory Comput. Syst. 2005, Volume 38 (0) 2005
    Conference paper
    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. 2004, Volume 34 (0) 2005
    Conference paper
    Sophie Laplante, Frédéric Magniez.
    Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.
    19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA 2004 (0) 2004
    Conference paper
    Frédéric Magniez, Michel de Rougemont.
    Property Testing of Regular Tree Languages.
    Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings 2004 (0) 2004
    Conference paper
    Eldar Fischer, Frédéric Magniez, Michel de Rougemont.
    Property and Equivalence Testing on Strings
    Electronic Colloquium on Computational Complexity (ECCC) 2004, Volume null (0) 2004
    Conference paper
    Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen.
    Quantum Testers for Hidden Group Properties.
    Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen.
    Hidden translation and orbit coset in quantum computing.
    Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA 2003 (0) 2003
    Conference paper
    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. 2003, Volume 14 (0) 2003
    Conference paper
    Marcos A. Kiwi, Frédéric Magniez, Miklos Santha.
    Approximate testing with error relative to input size.
    J. Comput. Syst. Sci. 2003, Volume 66 (0) 2003
    Conference paper
    Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont.
    Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing.
    17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings 2002 (0) 2002
    Conference paper
    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 (0) 2001
    Conference paper
    Gábor Ivanyos, Frédéric Magniez, Miklos Santha.
    Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem.
    SPAA 2001 (0) 2001
    Conference paper
    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) 2001, Volume 8 (0) 2001
    Conference paper
    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) 2001, Volume 8 (0) 2001
    Conference paper
    Marcos A. Kiwi, Frédéric Magniez, Miklos Santha.
    Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey.
    Theoretical Aspects of Computer Science, Advanced Lectures (First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000) 2002 (0) 2000
    Conference paper
    Frédéric Magniez.
    Multi-linearity Self-Testing with Relative Error.
    STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings 2000 (0) 2000
    Conference paper
    Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha.
    Self-testing of universal and fault-tolerant sets of quantum gates.
    STOC 2000 (0) 2000
    Conference paper
    Marcos A. Kiwi, Frédéric Magniez, Miklos Santha.
    Approximate Testing with Relative Error.
    STOC 1999 (0) 1999
    Conference paper
    Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha.
    Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
    CoRR 1999, Volume 0 (0) 1999
    Show item 1 to 84 of 84  

    Your query returned 84 matches in the database.