Browsing by Author MIKLOS SANTHA

Showing results 1 to 14 of 14
Issue DateTitleAuthor(s)
Feb-2012An efficient quantum algorithm for the hidden subgroup problem in nil-2 groupsIvanyos, G.; Sanselme, L.; Santha, M. 
2008An efficient quantum algorithm for the hidden subgroup problem in nil-2 groupsIvanyos, G.; Sanselme, L.; Santha, M. 
2013Hidden symmetry subgroup problemsDecker, T.; Ivanyos, G.; Santha, M. ; Wocjan, P.
2011Improved bounds for the randomized decision tree complexity of recursive majorityMagniez, F.; Nayak, A.; Santha, M. ; Xiao, D.
2013Improved quantum query algorithms for triangle finding and associativity testingLee, T.; Magniez, F.; Santha, M. 
14-Jan-2015Nonlocality and conflicting interest gamesPappa, Anna; Kumar, Niraj; Lawson, Thomas; Santha, Miklos ; Zhang, Shengyu; Diamanti, Eleni; Kerenidis, Iordanis
Jul-2009On the black-box complexity of Sperner's LemmaFriedl, K.; Ivanyos, G.; Santha, M. ; Verhoeven, Y.F.
2009On the hitting times of quantum versus random walksMagniez, F.; Nayak, A.; Richter, P.C.; Santha, M. 
Jun-2012On the hitting times of quantum versus random walksMagniez, F.; Nayak, A.; Richter, P.C.; Santha, M. 
2010Optimal direct sum results for deterministic and randomized decision tree complexityJain, R. ; Klauck, H.; Santha, M. 
2015Quantum and randomized query complexities (Extended abstract)Santha M 
2008Quantum walk based search algorithmsSantha, M. 
2013Query complexity of matroidsKulkarni, R.; Santha, M. 
2011The complexity of approximate Nash equilibrium in congestion games with negative delaysMagniez, F.; De Rougemont, M.; Santha, M. ; Zeitoun, X.