Get started
Author

Frédéric Magniez

Observed names: F. Magniez, FRÉDÉRIC MAGNIEZ, Frederic Magniez, Frédéic Magniez, Magniez, F, Magniez, F., Magniez, Frederic, Magniez, Frédéric, Stacey Jeffery, Frederic Magniez, Ronald De Wolf
Observed institutions: Université Paris-Sud, Centre for Quantum Technologies, Centre National de la Recherche Scientifique, University of Waterloo, National University of Singapore, Délégation Paris 7, Perimeter Institute, Collège de France, Université Paris Cité, Brown University, Sorbonne Paris Cité, Laboratoire d'Informatique Algorithmique: Fondements et Applications, Institut de Recherche en Informatique Fondamentale, Laboratoire de Recherche en Informatique, Université Paris Diderot
ORCID: 0000-0003-2384-9026
Observed ORCID: 0000-0003-2384-9026
OpenAlex ID: A5045780938
Quantum Algorithms for the Triangle Problem
2007 · Frédéric Magniez, Miklos Santha, et al. · SIAM Journal on Computing · 314
Search via Quantum Walk
2011 · Frédéric Magniez, Ashwin Nayak, et al. · SIAM Journal on Computing · 299
PDF
Hidden translation and orbit coset in quantum computing
2003 · Katalin Friedl, Gábor Ivanyos, et al. · ACM Symposium on Theory of Computing (STOC) · 134
Search via quantum walk
2007 · Frederic Magniez, Ashwin Nayak, et al. · ACM Symposium on Theory of Computing (STOC) · 129
Quantum Algorithms for Element Distinctness
2005 · Harry Buhrman, Christoph Dürr, et al. · SIAM Journal on Computing · 104
PDF
Quantum algorithms for element distinctness
2002 · H. Buhrman, C. Durr, et al. · IEEE Conference on Computational Complexity (CCC) · 96
Quantum algorithms for the triangle problem
2005 · Frédéric Magniez, Miklós Sántha, et al. · 86
Quantum Walks Can Find a Marked Element on Any Graph
2015 · Hari Krovi, Frédéric Magniez, et al. · Algorithmica · 81
PDF
Efficient Quantum Algorithms for Some Instances of the Non-abelian Hidden Subgroup Problem
2003 · GÁBOR IVANYOS, FRÉDÉRIC MAGNIEZ, et al. · International Journal of Foundations of Computer Science · 79
Maximum Matching in Semi-streaming with Few Passes
2012 · Christian Konrad, Frédéric Magniez, et al. · Lecture notes in computer science · 73
On the hitting times of quantum versus random walks
2008 · Magniez, Frederic, Nayak, Ashwin, et al. · HAL · 72
19th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2024)
2024 · Magniez, Frédéric, Bredariol Grilo, Alex · HAL · 67
Quantum Complexity of Testing Group Commutativity
2007 · Frederic Magniez, Ashwin Nayak · Algorithmica · 67
Self-testing of Quantum Circuits
2006 · Frédéric Magniez, Dominic Mayers, et al. · Lecture notes in computer science · 59
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
2008 · Sophie Laplante, Frédéric Magniez · SIAM Journal on Computing · 46
Time-Efficient Quantum Walks for 3-Distinctness
2013 · Aleksandrs Belovs, Andrew M. Childs, et al. · Lecture notes in computer science · 44
Finding Is as Easy as Detecting for Quantum Walks
2010 · Hari Krovi, Frédéric Magniez, et al. · Lecture notes in computer science · 39
Recognizing well-parenthesized expressions in the streaming model
2010 · Frédéric Magniez, Claire Mathieu, et al. · ACM Symposium on Theory of Computing (STOC) · 37
Strong no-go theorem for Gaussian quantum bit commitment
2010 · Loïck Magnin, Frédéric Magniez, et al. · Physical Review A · 37
PDF
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks
2018 · François Le Gall, Frédéric Magniez · ACM Symposium on Principles of Distributed Computing (PODC) · 35
PDF
Nested Quantum Walks with Quantum Data Structures
2013 · Stacey Jeffery, Robin Kothari, et al. · 34
Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing
2013 · Troy Lee, Frédéric Magniez, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 33
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
2001 · Gábor Ivanyos, Frédéric Magniez, et al. · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · 32
Nested Quantum Walks with Quantum Data Structures
2013 · Stacey Jeffery, Robin Kothari, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 29
PDF
Quantum Complexity of Testing Group Commutativity
2005 · Frédéric Magniez, Ashwin Nayak · Lecture notes in computer science · 26
Works count: 139
Citation count: 2,721
H-index: 26
I10-index: 57
Year
Topic
Type