Travelled to:1 × Switzerland
2 × Denmark
6 × USA
Collaborated with:F.Magniez G.Ivanyos K.Friedl A.Nayak M.Szegedy M.A.Kiwi C.Bazgan Z.Tuza D.Xiao J.Roland W.v.Dam M.Mosca R.Kulkarni Y.Qiao A.Sundaram P.Sen
Talks about:quantum (4) complex (3) test (3) approxim (2) problem (2) search (2) effici (2) relat (2) error (2) constraint (1)
Person: Miklos Santha
DBLP: Santha:Miklos
Contributed to:
20142011
2007200520042003200019991998Wrote 9 papers:
- ICALP-v1-2014-IvanyosKQSS #complexity #constraints #fault #on the #problem
- On the Complexity of Trial and Error for Constraint Satisfaction Problems (GI, RK, YQ, MS, AS), pp. 663–675.
- 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.
- STOC-2007-MagniezNRS #quantum
- Search via quantum walk (FM, AN, JR, MS), pp. 575–584.
- STOC-2005-FriedlIS #performance #testing
- Efficient testing of groups (KF, GI, MS), pp. 157–166.
- STOC-2004-SanthaS #quantum #query
- Quantum and classical query complexities of local search are polynomially related (MS, MS), pp. 494–501.
- STOC-2003-FriedlIMSS #quantum
- Hidden translation and orbit coset in quantum computing (KF, GI, FM, MS, PS), pp. 1–9.
- 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.
- ICALP-1998-BazganST #algorithm #approximate #performance #problem #similarity
- Efficient Approximation Algorithms for the Subset-Sums Equality Problem (CB, MS, ZT), pp. 387–396.