Travelled to:1 × Denmark
1 × Finland
1 × France
1 × Italy
1 × Latvia
1 × Portugal
1 × Switzerland
1 × United Kingdom
6 × USA
Collaborated with:A.Nayak M.Santha M.d.Rougemont S.Jeffery R.Kothari J.Roland M.Mosca C.Mathieu E.Fischer M.A.Kiwi D.Xiao H.Krovi M.Ozols D.Mayers H.Ollivier W.v.Dam A.Belovs A.M.Childs K.Friedl G.Ivanyos P.Sen S.Laplante R.Lassaigne S.Peyronnet
Talks about:quantum (8) test (6) complex (3) walk (3) properti (2) approxim (2) improv (2) model (2) tree (2) self (2)
Person: Frédéric Magniez
DBLP: Magniez:Fr=eacute=d=eacute=ric
Contributed to:
2013201220112010
201020072006
2006200520042003200220001999Wrote 14 papers:
- ICALP-v1-2013-BelovsCJKM #3d #quantum
- Time-Efficient Quantum Walks for 3-Distinctness (AB, AMC, SJ, RK, FM), pp. 105–122.
- ICALP-v1-2012-JefferyKM #complexity #graph #matrix #multi #quantum #query #using
- Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (SJ, RK, FM), pp. 522–532.
- ICALP-v1-2011-MagniezNSX #bound #complexity #random #recursion
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (FM, AN, MS, DX), pp. 317–329.
- ICALP-v1-2010-KroviMOR #detection #quantum
- Finding Is as Easy as Detecting for Quantum Walks (HK, FM, MO, JR), pp. 540–551.
- STOC-2010-MagniezMN #streaming
- Recognizing well-parenthesized expressions in the streaming model (FM, CM, AN), pp. 261–270.
- STOC-2007-MagniezNRS #quantum
- Search via quantum walk (FM, AN, JR, MS), pp. 575–584.
- ICALP-v1-2006-MagniezMMO #quantum #self
- Self-testing of Quantum Circuits (FM, DM, MM, HO), pp. 72–83.
- LICS-2006-FischerMR #approximate #equivalence #satisfiability
- Approximate Satisfiability and Equivalence (EF, FM, MdR), pp. 421–430.
- ICALP-2005-MagniezN #commutative #complexity #quantum #testing
- Quantum Complexity of Testing Group Commutativity (FM, AN), pp. 1312–1324.
- ICALP-2004-MagniezR #testing
- Property Testing of Regular Tree Languages (FM, MdR), pp. 932–944.
- STOC-2003-FriedlIMSS #quantum
- Hidden translation and orbit coset in quantum computing (KF, GI, FM, MS, PS), pp. 1–9.
- LICS-2002-LaplanteLMPR #abstraction #approach #model checking #probability #testing
- Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing (SL, RL, FM, SP, MdR), pp. 30–39.
- STOC-2000-DamMMS #fault tolerance #quantum #self #set
- Self-testing of universal and fault-tolerant sets of quantum gates (WvD, FM, MM, MS), pp. 688–696.
- STOC-1999-KiwiMS #approximate #fault #testing
- Approximate Testing with Relative Error (MAK, FM, MS), pp. 51–60.