|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 9 keywords
|
|
|
|
|
Results
Found 47 publication records. Showing 47 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha |
On the Hitting Times of Quantum Versus Random Walks.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Troy Lee, Frédéric Magniez, Miklos Santha |
A learning graph based quantum query algorithm for finding constant-size subgraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Christian Konrad, Frédéric Magniez, Claire Mathieu |
Maximum Matching in Semi-Streaming with Few Passes |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha |
Search via Quantum Walk. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao |
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Christian Konrad, Frédéric Magniez |
The Streaming Complexity of Validating XML Documents |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eldar Fischer, Frédéric Magniez, Michel de Rougemont |
Approximate Satisfiability and Equivalence. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hari Krovi, Frédéric Magniez, Maris Ozols, Jérémie Roland |
Finding Is as Easy as Detecting for Quantum Walks. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Claire Mathieu, Ashwin Nayak |
Recognizing well-parenthesized expressions in the streaming model. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Claire Mathieu, Ashwin Nayak |
Recognizing well-parenthesized expressions in the streaming model. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak |
Foreword from the Guest Editors. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Miklos Santha, Frédéric Magniez, Pranab Sen |
Quantum Testers for Hidden Group Properties. |
Fundam. Inform. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Claire Mathieu, Ashwin Nayak |
Recognizing well-parenthesized expressions in the streaming model |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha |
On the hitting times of quantum versus random walks. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sophie Laplante, Frédéric Magniez |
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak |
Quantum Complexity of Testing Group Commutativity. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Michel de Rougemont |
Property Testing of Regular Tree Languages. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
Edit distance with moves, Property testing, Regular trees languages |
| 1 | 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 |
DBLP DOI BibTeX RDF |
Approximate verification, probabilistic abstraction, model checking, property testing, probabilistic verification |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Miklos Santha, Mario Szegedy |
Quantum Algorithms for the Triangle Problem. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Jérémie Roland, Miklos Santha |
Search via quantum walk. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
amplitude amplification, phase gap, recursive amplitude amplification, reflection operator, spectral gap, search, Markov chain, phase estimation, hitting time, quantum walk |
| 1 | Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier |
Self-testing of Quantum Circuits. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Frédéric Magniez, Michel de Rougemont |
Approximate Satisfiability and Equivalence. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez |
Multi-Linearity Self-Testing with Relative Error. |
Theory Comput. Syst. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Miklos Santha, Mario Szegedy |
Quantum algorithms for the triangle problem. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak |
Quantum Complexity of Testing Group Commutativity. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eldar Fischer, Frédéric Magniez, Michel de Rougemont |
Property and Equivalence Testing on Strings |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Magniez, Michel de Rougemont |
Property Testing of Regular Tree Languages. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sophie Laplante, Frédéric Magniez |
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcos A. Kiwi, Frédéric Magniez, Miklos Santha |
Approximate testing with error relative to input size. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen |
Quantum Testers for Hidden Group Properties. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen |
Hidden translation and orbit coset in quantum computing. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Gábor Ivanyos, Frédéric Magniez, Miklos Santha |
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Christoph Dürr, Mark Heiligman, Peter Høyer, Frédéric Magniez, Miklos Santha, Ronald de Wolf |
Quantum Algorithms for Element Distinctness. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez |
Multi-linearity Self-Testing with Relative Error. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha |
Self-testing of universal and fault-tolerant sets of quantum gates. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Wim van Dam, Frédéric Magniez, Michele Mosca, Miklos Santha |
Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates |
CoRR |
1999 |
DBLP BibTeX RDF |
|
| 1 | Marcos A. Kiwi, Frédéric Magniez, Miklos Santha |
Approximate Testing with Relative Error. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #47 of 47 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")