| 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 | 2756 | 1998 |
| Private information retrieval B Chor, O Goldreich, E Kushilevitz, M Sudan Proceedings of IEEE 36th Annual Foundations of Computer Science, 41-50, 1995 | 2600 | 1995 |
| A fuzzy vault scheme A Juels, M Sudan Designs, Codes and Cryptography 38 (2), 237-257, 2006 | 1957 | 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 | 1420 | 1998 |
| Priority encoding transmission A Albanese, J Blomer, J Edmonds, M Luby, M Sudan IEEE transactions on information theory 42 (6), 1737-1744, 1996 | 984 | 1996 |
| Decoding of Reed Solomon codes beyond the error-correction bound M Sudan Journal of complexity 13 (1), 180-193, 1997 | 887 | 1997 |
| Robust characterizations of polynomials with applications to program testing R Rubinfeld, M Sudan SIAM Journal on Computing 25 (2), 252-271, 1996 | 870 | 1996 |
| Approximate graph coloring by semidefinite programming D Karger, R Motwani, M Sudan Journal of the ACM (JACM) 45 (2), 246-265, 1998 | 666* | 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 | 582 | 1995 |
| Free bits, PCPs, and nonapproximability---towards tight results M Bellare, O Goldreich, M Sudan SIAM Journal on Computing 27 (3), 804-915, 1998 | 542 | 1998 |
| Complexity classifications of Boolean constraint satisfaction problems N Creignou, S Khanna, M Sudan Society for Industrial and Applied Mathematics, 2001 | 519 | 2001 |
| Description logics F Baader, I Horrocks, U Sattler Handbook on ontologies, 3-28, 2004 | 421 | 2004 |
| Pseudorandom generators without the XOR lemma M Sudan, L Trevisan, S Vadhan Journal of Computer and System Sciences 62 (2), 236-266, 2001 | 418 | 2001 |
| 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 | 390 | 1994 |
| Collision-Free Hashing from Lattice Problems. O Goldreich, S Goldwasser, S Halevi IACR Cryptol. ePrint Arch. 1996, 9, 1996 | 354* | 1996 |
| E cient routing and scheduling algorithms for optical networks A Aggarwal, A Bar-Noy, D Coppersmith, R Ramaswami, B Schieber, ... Proc. of SODA 93, 1994 | 352* | 1994 |
| Improved low-degree testing and its applications S Arora, M Sudan Combinatorica 23 (3), 365-426, 2003 | 343 | 2003 |
| Approximating minimum feedback sets and multicuts in directed graphs G Even, JS Naor, B Schieber, M Sudan Algorithmica 20 (2), 151-174, 1998 | 328 | 1998 |
| Efficient decoding of Reed-Solomon codes beyond half the minimum distance RM Roth, G Ruckenstein IEEE Transactions on Information Theory 46 (1), 246-257, 2000 | 323 | 2000 |
| List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition V Guruswami Springer Science & Business Media, 2004 | 312 | 2004 |
