Full Name
MIKLOS SANTHA
Variants
Santha, Miklos
Santha, M.
Santha M
 
 
 
Email
cqtms@nus.edu.sg
 

Publications

Results 1-14 of 14 (Search time: 1.1 seconds).

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