Frédéric Magniez
Titre
Citée par
Citée par
Année
Quantum algorithms for the triangle problem
F Magniez, M Santha, M Szegedy
SIAM Journal on Computing 37 (2), 413-424, 2007
3452007
Search via quantum walk
F Magniez, A Nayak, J Roland, M Santha
SIAM journal on computing 40 (1), 142-164, 2011
3102011
Quantum algorithms for element distinctness
H Buhrman, C Dürr, M Heiligman, P Høyer, F Magniez, M Santha, ...
SIAM Journal on Computing 34 (6), 1324-1330, 2005
172*2005
Hidden Translation and Translating Coset in Quantum Computing
K Friedl, G Ivanyos, F Magniez, M Santha, P Sen
SIAM Journal on Computing 43 (1), 1-24, 2014
147*2014
Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem
G Ivanyos, F Magniez, M Santha
International Journal of Foundations of Computer Science 14 (05), 723-739, 2003
1152003
Quantum complexity of testing group commutativity
F Magniez, A Nayak
Algorithmica 48 (3), 221-232, 2007
972007
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
S Laplante, F Magniez
SIAM Journal on Computing 38 (1), 46-62, 2008
922008
Maximum matching in semi-streaming with few passes
C Konrad, F Magniez, C Mathieu
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
802012
On the hitting times of quantum versus random walks
F Magniez, A Nayak, PC Richter, M Santha
Algorithmica 63 (1-2), 91-116, 2012
792012
Self-testing of quantum circuits
F Magniez, D Mayers, M Mosca, H Ollivier
International Colloquium on Automata, Languages, and Programming, 72-83, 2006
622006
Recognizing well-parenthesized expressions in the streaming model
F Magniez, C Mathieu, A Nayak
SIAM Journal on Computing 43 (6), 1880-1905, 2014
562014
Quantum walks can find a marked element on any graph
H Krovi, F Magniez, M Ozols, J Roland
Algorithmica 74 (2), 851-907, 2016
512016
Probabilistic abstraction for model checking: An approach based on property testing
S Laplante, R Lassaigne, F Magniez, S Peyronnet, M De Rougemont
ACM Transactions on Computational Logic (TOCL) 8 (4), 20, 2007
47*2007
Finding is as easy as detecting for quantum walks
H Krovi, F Magniez, M Ozols, J Roland
International Colloquium on Automata, Languages, and Programming, 540-551, 2010
422010
Time-efficient quantum walks for 3-distinctness
A Belovs, AM Childs, S Jeffery, R Kothari, F Magniez
International Colloquium on Automata, Languages, and Programming, 105-122, 2013
41*2013
Approximate satisfiability and equivalence
E Fischer, F Magniez, M De Rougemont
SIAM Journal on Computing 39 (6), 2251-2281, 2010
41*2010
Improved quantum query algorithms for triangle finding and associativity testing
T Lee, F Magniez, M Santha
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
382013
Property testing of regular tree languages
F Magniez, M de Rougemont
Algorithmica 49 (2), 127-146, 2007
382007
Strong no-go theorem for Gaussian quantum bit commitment
L Magnin, F Magniez, A Leverrier, NJ Cerf
Physical Review A 81 (1), 010302, 2010
332010
Self-testing of universal and fault-tolerant sets of quantum gates
W Van Dam, F Magniez, M Mosca, M Santha
SIAM Journal on Computing 37 (2), 611-629, 2007
30*2007
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20