| Generating quasi-random sequences from semi-random sources M Santha, UV Vazirani Journal of computer and system sciences 33 (1), 75-87, 1986 | 477 | 1986 |
| Quantum algorithms for the triangle problem F Magniez, M Santha, M Szegedy SIAM Journal on Computing 37 (2), 413-424, 2007 | 397 | 2007 |
| Search via quantum walk F Magniez, A Nayak, J Roland, M Santha SIAM journal on computing 40 (1), 142-164, 2011 | 373 | 2011 |
| Quantum walk based search algorithms M Santha International Conference on Theory and Applications of Models of Computation …, 2008 | 174 | 2008 |
| Hidden translation and translating coset in quantum computing K Friedl, G Ivanyos, F Magniez, M Santha, P Sen SIAM Journal on Computing 43 (1), 1-24, 2014 | 153* | 2014 |
| Oblivious transfers and intersecting codes G Brassard, C Crépeau, M Santha IEEE Transactions on Information Theory 42 (6), 1769-1780, 1996 | 133 | 1996 |
| Quantum attacks on Bitcoin, and how to protect against them D Aggarwal, GK Brennen, T Lee, M Santha, M Tomamichel arXiv preprint arXiv:1710.10377, 2017 | 126 | 2017 |
| Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem G Ivanyos, F Magniez, M Santha International Journal of Foundations of Computer Science 14 (05), 723-739, 2003 | 118 | 2003 |
| Deciding bisimilarity isP-complete J Balcázar, J Gabarro, M Santha Formal aspects of computing 4 (1), 638-648, 1992 | 110 | 1992 |
| Quantum algorithms for element distinctness H Buhrman, C Durr, M Heiligman, P Hoyer, F Magniez, M Santha, ... Proceedings 16th Annual IEEE Conference on Computational Complexity, 131-137, 2001 | 103 | 2001 |
| A decision procedure for unitary linear quantum cellular automata C Dürr, M Santha SIAM Journal on Computing 31 (4), 1076-1089, 2002 | 94* | 2002 |
| On the hitting times of quantum versus random walks F Magniez, A Nayak, PC Richter, M Santha Algorithmica 63 (1), 91-116, 2012 | 93 | 2012 |
| Quantum algorithms for element distinctness H Buhrman, C Dürr, M Heiligman, P Høyer, F Magniez, M Santha, ... SIAM Journal on Computing 34 (6), 1324-1330, 2005 | 88 | 2005 |
| On the Monte carlo boolean decision tree complexity of read‐once formulae M Santha Random Structures & Algorithms 6 (1), 75-87, 1995 | 78 | 1995 |
| Separations in query complexity based on pointer functions A Ambainis, K Balodis, A Belovs, T Lee, M Santha, J Smotrovs Journal of the ACM (JACM) 64 (5), 1-24, 2017 | 72 | 2017 |
| Nonlocality and conflicting interest games A Pappa, N Kumar, T Lawson, M Santha, S Zhang, E Diamanti, I Kerenidis Physical review letters 114 (2), 020401, 2015 | 65 | 2015 |
| An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups G Ivanyos, L Sanselme, M Santha Algorithmica 62 (1), 480-498, 2012 | 50* | 2012 |
| On the approximation of finding a (nother) Hamiltonian cycle in cubic Hamiltonian graphs C Bazgan, M Santha, Z Tuza Journal of Algorithms 31 (1), 249-268, 1999 | 50 | 1999 |
| Limiting negations in constant depth circuits M Santha, C Wilson SIAM Journal on Computing 22 (2), 294-302, 1993 | 49* | 1993 |
| Improved quantum query algorithms for triangle finding and associativity testing T Lee, F Magniez, M Santha Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 43 | 2013 |
