| Private information retrieval B Chor, E Kushilevitz, O Goldreich, M Sudan Journal of the ACM (JACM) 45 (6), 965-981, 1998 | 3358 | 1998 |
| Proof verification and the hardness of approximation problems S Arora, C Lund, R Motwani, M Sudan, M Szegedy Journal of the ACM (JACM) 45 (3), 501-555, 1998 | 3192 | 1998 |
| A fuzzy vault scheme A Juels, M Sudan Designs, Codes and Cryptography 38, 237-257, 2006 | 2239 | 2006 |
| Improved decoding of Reed-Solomon and algebraic-geometric codes V Guruswami, M Sudan Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998 | 1655 | 1998 |
| Robust characterizations of polynomials with applications to program testing R Rubinfeld, M Sudan SIAM Journal on Computing 25 (2), 252-271, 1996 | 1035 | 1996 |
| Decoding of Reed Solomon codes beyond the error-correction bound M Sudan Journal of complexity 13 (1), 180-193, 1997 | 1023 | 1997 |
| Priority encoding transmission A Albanese, J Blomer, J Edmonds, M Luby, M Sudan IEEE transactions on information theory 42 (6), 1737-1744, 1996 | 1004 | 1996 |
| Approximate graph coloring by semidefinite programming D Karger, R Motwani, M Sudan Journal of the ACM (JACM) 45 (2), 246-265, 1998 | 743* | 1998 |
| A reliable dissemination protocol for interactive collaborative applications R Yavatkar, J Griffoen, M Sudan Proceedings of the third ACM International Conference on Multimedia, 333-344, 1995 | 601 | 1995 |
| Free bits, PCPs, and nonapproximability---towards tight results M Bellare, O Goldreich, M Sudan SIAM Journal on Computing 27 (3), 804-915, 1998 | 600 | 1998 |
| Complexity classifications of Boolean constraint satisfaction problems N Creignou, S Khanna, M Sudan Society for Industrial and Applied Mathematics, 2001 | 576 | 2001 |
| Pseudorandom generators without the XOR lemma M Sudan, L Trevisan, S Vadhan Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 526 | 1999 |
| Approximating minimum feedback sets and multicuts in directed graphs G Even, J Naor, B Schieber, M Sudan Algorithmica 20, 151-174, 1998 | 459* | 1998 |
| The minimum latency problem A Blum, P Chalasani, D Coppersmith, B Pulleyblank, P Raghavan, ... Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994 | 450 | 1994 |
| Improved low-degree testing and its applications S Arora, M Sudan Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 387 | 1997 |
| Robust PCPs of proximity, shorter PCPs and applications to coding E Ben-Sasson, O Goldreich, P Harsha, M Sudan, S Vadhan Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 385 | 2004 |
| Gadgets, approximation, and linear programming L Trevisan, GB Sorkin, M Sudan, DP Williamson SIAM Journal on Computing 29 (6), 2074-2097, 2000 | 374 | 2000 |
| Efficient routing in optical networks A Aggarwal, A Bar-Noy, D Coppersmith, R Ramaswami, B Schieber, ... Journal of the ACM (JACM) 43 (6), 973-1001, 1996 | 357 | 1996 |
| List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition V Guruswami Springer Science & Business Media, 2004 | 351 | 2004 |
| Chinese remaindering with errors O Goldreich, D Ron, M Sudan Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999 | 294 | 1999 |
