Quantum walk based search algorithms

by Santha, M.
Published 2014

Quantum and randomized query complexities (Extended abstract)

by Santha M
Published 2016

Query complexity of matroids

by Kulkarni, R., Santha, M.
Published 2014

Improved quantum query algorithms for triangle finding and associativity testing

by Lee, T., Magniez, F., Santha, M.
Published 2014

Optimal direct sum results for deterministic and randomized decision tree complexity

by Jain, R., Klauck, H., Santha, M.
Published 2013

An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups

by Ivanyos, G., Sanselme, L., Santha, M.
Published 2014

An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups

by Ivanyos, G., Sanselme, L., Santha, M.
Published 2014

Hidden symmetry subgroup problems

by Decker, T., Ivanyos, G., Santha, M., Wocjan, P.
Published 2014

Improved bounds for the randomized decision tree complexity of recursive majority

by Magniez, F., Nayak, A., Santha, M., Xiao, D.
Published 2014

The complexity of approximate Nash equilibrium in congestion games with negative delays

by Magniez, F., De Rougemont, M., Santha, M., Zeitoun, X.
Published 2014

On the hitting times of quantum versus random walks

by Magniez, F., Nayak, A., Richter, P.C., Santha, M.
Published 2014

On the hitting times of quantum versus random walks

by Magniez, F., Nayak, A., Richter, P.C., Santha, M.
Published 2014

On the black-box complexity of Sperner's Lemma

by Friedl, K., Ivanyos, G., Santha, M., Verhoeven, Y.F.
Published 2014