Miklos Santha

Collaboration Map View Statistics Email Alert RSS Feed

Full Name

Miklos Santha

Variants

Santha, Miklos
Santha, M.
Santha M

Main Affiliation

CENTRE FOR QUANTUM TECHNOLOGIES

Faculty

SPECIALITY RESEARCH INSTITUTES/CENTRES

cqtms@nus.edu.sg

Results 1-13 of 13 (Search time: 0.012 seconds).

Refman EndNote Bibtex RefWorks Excel CSV PDF Send via email

	Issue Date	Title	Author(s)
1	2008	An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups	Ivanyos, G.; Sanselme, L.; Santha, M.
2	Feb-2012	An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups	Ivanyos, G.; Sanselme, L.; Santha, M.
3	2013	Hidden symmetry subgroup problems	Decker, T.; Ivanyos, G.; Santha, M. ; Wocjan, P.
4	2011	Improved bounds for the randomized decision tree complexity of recursive majority	Magniez, F.; Nayak, A.; Santha, M. ; Xiao, D.
5	2013	Improved quantum query algorithms for triangle finding and associativity testing	Lee, T.; Magniez, F.; Santha, M.
6	Jul-2009	On the black-box complexity of Sperner's Lemma	Friedl, K.; Ivanyos, G.; Santha, M. ; Verhoeven, Y.F.
7	2009	On the hitting times of quantum versus random walks	Magniez, F.; Nayak, A.; Richter, P.C.; Santha, M.
8	Jun-2012	On the hitting times of quantum versus random walks	Magniez, F.; Nayak, A.; Richter, P.C.; Santha, M.
9	2010	Optimal direct sum results for deterministic and randomized decision tree complexity	Jain, R. ; Klauck, H.; Santha, M.
10	2015	Quantum and randomized query complexities (Extended abstract)	Santha M
11	2008	Quantum walk based search algorithms	Santha, M.
12	2013	Query complexity of matroids	Kulkarni, R.; Santha, M.
13	2011	The complexity of approximate Nash equilibrium in congestion games with negative delays	Magniez, F.; De Rougemont, M.; Santha, M. ; Zeitoun, X.