default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrédéric Magniez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c41]Pierre Fraigniaud
, Maël Luce, Frédéric Magniez, Ioan Todinca:
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. PODC 2024: 209-219- [e1]Frédéric Magniez, Alex Bredariol Grilo:
19th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2024, September 9-13, 2024, Okinawa, Japan. LIPIcs 310, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-328-7 [contents] - [i33]Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca:
Even-Cycle Detection in the Randomized and Quantum CONGEST Model. CoRR abs/2402.12018 (2024) - 2023
- [j28]Yassine Hamoudi, Frédéric Magniez:
Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs. ACM Trans. Comput. Theory 15(1-2): 1-22 (2023) - 2022
- [j27]Frédéric Magniez, Ashwin Nayak:
Quantum Distributed Complexity of Set Disjointness on a Line. ACM Trans. Comput. Theory 14(1): 5:1-5:22 (2022) - 2021
- [c40]Yassine Hamoudi, Frédéric Magniez:
Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs. TQC 2021: 1:1-1:21 - 2020
- [j26]Titouan Carette, Mathieu Laurière, Frédéric Magniez:
Extended Learning Graphs for Triangle Finding. Algorithmica 82(4): 980-1005 (2020) - [c39]Frédéric Magniez, Ashwin Nayak:
Quantum Distributed Complexity of Set Disjointness on a Line. ICALP 2020: 82:1-82:18 - [c38]Taisuke Izumi, François Le Gall, Frédéric Magniez:
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. STACS 2020: 23:1-23:13 - [i32]Yassine Hamoudi, Frédéric Magniez:
Quantum Time-Space Tradeoffs by Recording Queries. CoRR abs/2002.08944 (2020) - [i31]Frédéric Magniez, Ashwin Nayak:
Quantum Distributed Complexity of Set Disjointness on a Line. CoRR abs/2002.11795 (2020)
2010 – 2019
- 2019
- [c37]Yassine Hamoudi, Frédéric Magniez:
Quantum Chebyshev's Inequality and Applications. ICALP 2019: 69:1-69:16 - [i30]Taisuke Izumi, François Le Gall, Frédéric Magniez:
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. CoRR abs/1908.11488 (2019) - 2018
- [j25]Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez:
Streaming Communication Protocols. ACM Trans. Comput. Theory 10(4): 19:1-19:21 (2018) - [c36]François Le Gall, Frédéric Magniez:
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. PODC 2018: 337-346 - [c35]Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya:
Improved bounds for testing Dyck languages. SODA 2018: 1529-1544 - [i29]François Le Gall, Frédéric Magniez:
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. CoRR abs/1804.02917 (2018) - [i28]Yassine Hamoudi, Frédéric Magniez:
Quantum Chebyshev's Inequality and Applications. CoRR abs/1807.06456 (2018) - 2017
- [j24]Troy Lee, Frédéric Magniez, Miklos Santha:
Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing. Algorithmica 77(2): 459-486 (2017) - [j23]Stacey Jeffery, Frédéric Magniez, Ronald de Wolf:
Optimal Parallel Quantum Query Algorithms. Algorithmica 79(2): 509-529 (2017) - [c34]Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez:
Streaming Communication Protocols. ICALP 2017: 130:1-130:14 - [c33]Titouan Carette, Mathieu Laurière, Frédéric Magniez:
Extended Learning Graphs for Triangle Finding. STACS 2017: 20:1-20:14 - [i27]Eldar Fischer, Frédéric Magniez, Tatiana Starikovskaya:
Improved bounds for testing Dyck languages. CoRR abs/1707.06606 (2017) - 2016
- [j22]Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland:
Quantum Walks Can Find a Marked Element on Any Graph. Algorithmica 74(2): 851-907 (2016) - [j21]Stacey Jeffery, Robin Kothari, François Le Gall, Frédéric Magniez:
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. Algorithmica 76(1): 1-16 (2016) - [j20]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 48(3): 612-638 (2016) - [c32]Varun Kanade, Nikos Leonardos, Frédéric Magniez:
Stable Matching with Evolving Preferences. APPROX-RANDOM 2016: 36:1-36:13 - [c31]Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre:
Streaming Property Testing of Visibly Pushdown Languages. ESA 2016: 43:1-43:17 - [i26]Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez:
Streaming Communication Protocols. CoRR abs/1609.07059 (2016) - [i25]Titouan Carette, Mathieu Laurière, Frédéric Magniez:
Extended Learning Graphs for Triangle Finding. CoRR abs/1609.07786 (2016) - [i24]Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez:
Streaming Communication Protocols. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i23]Nathanaël François, Frédéric Magniez, Michel de Rougemont, Olivier Serre:
Streaming Property Testing of Visibly Pushdown Languages. CoRR abs/1505.03334 (2015) - [i22]Varun Kanade, Nikos Leonardos, Frédéric Magniez:
Stable Matching with Evolving Preferences. CoRR abs/1509.01988 (2015) - [i21]Nathanaël François, Frédéric Magniez, Olivier Serre, Michel de Rougemont:
Streaming Property Testing of Visibly Pushdown Languages. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j19]Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen:
Hidden Translation and Translating Coset in Quantum Computing. SIAM J. Comput. 43(1): 1-24 (2014) - [j18]Frédéric Magniez, Claire Mathieu, Ashwin Nayak:
Recognizing Well-Parenthesized Expressions in the Streaming Model. SIAM J. Comput. 43(6): 1880-1905 (2014) - [c30]Nathanaël François, Rahul Jain, Frédéric Magniez:
Unidirectional Input/Output Streaming Complexity of Reversal and Sorting. APPROX-RANDOM 2014: 654-668 - [c29]Stacey Jeffery, Frédéric Magniez, Ronald de Wolf:
Optimal Parallel Quantum Query Algorithms. ESA 2014: 592-604 - 2013
- [j17]Christian Konrad, Frédéric Magniez:
Validating XML documents in the streaming model with external memory. ACM Trans. Database Syst. 38(4): 27 (2013) - [c28]Aleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez:
Time-Efficient Quantum Walks for 3-Distinctness. ICALP (1) 2013: 105-122 - [c27]Stacey Jeffery, Robin Kothari, Frédéric Magniez:
Nested Quantum Walks with Quantum Data Structures. SODA 2013: 1474-1485 - [c26]Troy Lee, Frédéric Magniez, Miklos Santha:
Improved quantum query algorithms for triangle finding and associativity testing. SODA 2013: 1486-1502 - [c25]Nathanaël François, Frédéric Magniez:
Streaming Complexity of Checking Priority Queues. STACS 2013: 454-465 - [i20]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) - [i19]Marie-Claude Gaudel, Richard Lassaigne, Frédéric Magniez, Michel de Rougemont:
Some approximations in Model Checking and Testing. CoRR abs/1304.5199 (2013) - [i18]Nathanaël François, Frédéric Magniez:
Input/Output Streaming Complexity of Reversal and Sorting. CoRR abs/1309.0647 (2013) - [i17]Stacey Jeffery, Frédéric Magniez, Ronald de Wolf:
Optimal parallel quantum query algorithms. CoRR abs/1309.6116 (2013) - [i16]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 abs/1309.7565 (2013) - 2012
- [j16]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) - [j15]Troy Lee, Frédéric Magniez, Miklos Santha:
Learning graph based quantum query algorithms for finding constant-size subgraphs. Chic. J. Theor. Comput. Sci. 2012 (2012) - [c24]Christian Konrad, Frédéric Magniez, Claire Mathieu:
Maximum Matching in Semi-streaming with Few Passes. APPROX-RANDOM 2012: 231-242 - [c23]Stacey Jeffery, Robin Kothari, Frédéric Magniez:
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. ICALP (1) 2012: 522-532 - [c22]Christian Konrad, Frédéric Magniez:
Validating XML documents in the streaming model with external memory. ICDT 2012: 34-45 - [i15]Nathanaël François, Frédéric Magniez:
Streaming Complexity of Checking Priority Queues. CoRR abs/1209.4971 (2012) - [i14]Nathanaël François, Frédéric Magniez:
Streaming Complexity of Checking Priority Queues. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j14]Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via Quantum Walk. SIAM J. Comput. 40(1): 142-164 (2011) - [c21]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 - [c20]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 - [i13]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) - [i12]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) - [i11]Christian Konrad, Frédéric Magniez, Claire Mathieu:
Maximum Matching in Semi-Streaming with Few Passes. CoRR abs/1112.0184 (2011) - 2010
- [j13]Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Approximate Satisfiability and Equivalence. SIAM J. Comput. 39(6): 2251-2281 (2010) - [c19]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 - [c18]Frédéric Magniez, Claire Mathieu, Ashwin Nayak:
Recognizing well-parenthesized expressions in the streaming model. STOC 2010: 261-270 - [i10]Christian Konrad, Frédéric Magniez:
The Streaming Complexity of Validating XML Documents. CoRR abs/1012.3311 (2010) - [i9]Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao:
Improved bounds for the randomized decision tree complexity of recursive majority. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j12]Frédéric Magniez, Ashwin Nayak:
Foreword from the Guest Editors. Algorithmica 55(3): 393-394 (2009) - [j11]Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen:
Quantum Testers for Hidden Group Properties. Fundam. Informaticae 91(2): 325-340 (2009) - [c17]Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha:
On the hitting times of quantum versus random walks. SODA 2009: 86-95 - [i8]Frédéric Magniez, Claire Mathieu, Ashwin Nayak:
Recognizing well-parenthesized expressions in the streaming model. CoRR abs/0911.3291 (2009) - [i7]Frédéric Magniez, Claire Mathieu, Ashwin Nayak:
Recognizing well-parenthesized expressions in the streaming model. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j10]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) - [i6]Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha:
On the hitting times of quantum versus random walks. CoRR abs/0808.0084 (2008) - 2007
- [j9]Frédéric Magniez, Ashwin Nayak:
Quantum Complexity of Testing Group Commutativity. Algorithmica 48(3): 221-232 (2007) - [j8]Frédéric Magniez, Michel de Rougemont:
Property Testing of Regular Tree Languages. Algorithmica 49(2): 127-146 (2007) - [j7]Frédéric Magniez, Miklos Santha, Mario Szegedy:
Quantum Algorithms for the Triangle Problem. SIAM J. Comput. 37(2): 413-424 (2007) - [j6]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) - [j5]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): 20 (2007) - [c16]Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via quantum walk. STOC 2007: 575-584 - 2006
- [c15]Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier:
Self-testing of Quantum Circuits. ICALP (1) 2006: 72-83 - [c14]Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Approximate Satisfiability and Equivalence. LICS 2006: 421-430 - [i5]Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha:
Search via Quantum Walk. CoRR abs/quant-ph/0608026 (2006) - 2005
- [j4]Frédéric Magniez:
Multi-Linearity Self-Testing with Relative Error. Theory Comput. Syst. 38(5): 573-591 (2005) - [j3]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) - [c13]Frédéric Magniez, Ashwin Nayak:
Quantum Complexity of Testing Group Commutativity. ICALP 2005: 1312-1324 - [c12]Frédéric Magniez, Miklos Santha, Mario Szegedy:
Quantum algorithms for the triangle problem. SODA 2005: 1109-1117 - 2004
- [c11]Sophie Laplante, Frédéric Magniez:
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. CCC 2004: 294-304 - [c10]Frédéric Magniez, Michel de Rougemont:
Property Testing of Regular Tree Languages. ICALP 2004: 932-944 - [i4]Eldar Fischer, Frédéric Magniez, Michel de Rougemont:
Property and Equivalence Testing on Strings. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j2]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) - [j1]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) - [c9]Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen:
Quantum Testers for Hidden Group Properties. MFCS 2003: 419-428 - [c8]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 - 2002
- [c7]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
- [c6]Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf:
Quantum Algorithms for Element Distinctness. CCC 2001: 131-137 - [c5]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 - [i3]Marcos A. Kiwi, Frédéric Magniez, Miklos Santha:
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey. Electron. Colloquium Comput. Complex. TR01 (2001) - [i2]Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont:
Probabilistic abstraction for model checking: An approach based on property testing. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c4]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 - [c3]Frédéric Magniez:
Multi-linearity Self-Testing with Relative Error. STACS 2000: 302-313 - [c2]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
1990 – 1999
- 1999
- [c1]Marcos A. Kiwi, Frédéric Magniez, Miklos Santha:
Approximate Testing with Relative Error. STOC 1999: 51-60 - [i1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 21:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
