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 | 2627 | 1998 |

Private information retrieval B Chor, O Goldreich, E Kushilevitz, M Sudan Proceedings of IEEE 36th Annual Foundations of Computer Science, 41-50, 1995 | 2334 | 1995 |

A fuzzy vault scheme A Juels, M Sudan Designs, Codes and Cryptography 38 (2), 237-257, 2006 | 1807 | 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 | 1338 | 1998 |

Priority encoding transmission A Albanese, J Blomer, J Edmonds, M Luby, M Sudan IEEE transactions on information theory 42 (6), 1737-1744, 1996 | 939 | 1996 |

Decoding of Reed Solomon codes beyond the error-correction bound M Sudan Journal of complexity 13 (1), 180-193, 1997 | 825 | 1997 |

Robust characterizations of polynomials with applications to program testing R Rubinfeld, M Sudan SIAM Journal on Computing 25 (2), 252-271, 1996 | 800 | 1996 |

Approximate graph coloring by semidefinite programming D Karger, R Motwani, M Sudan Proceedings 35th Annual Symposium on Foundations of Computer Science, 2-13, 1994 | 633 | 1994 |

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 | 557 | 1995 |

Free bits, PCPs, and nonapproximability---towards tight results M Bellare, O Goldreich, M Sudan SIAM Journal on Computing 27 (3), 804-915, 1998 | 512 | 1998 |

Complexity classifications of boolean constraint satisfaction problems N Creignou, S Khanna, M Sudan SIAM, 2001 | 498 | 2001 |

Description logics F Baader, I Horrocks, U Sattler Handbook on ontologies, 3-28, 2004 | 383 | 2004 |

Pseudorandom generators without the XOR lemma M Sudan, L Trevisan, S Vadhan Journal of Computer and System Sciences 62 (2), 236-266, 2001 | 375 | 2001 |

On syntactic versus computational views of approximability S Khanna, R Motwani, M Sudan, U Vazirani SIAM Journal on Computing 28 (1), 164-191, 1998 | 360 | 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 | 356 | 1994 |

Efficient routing and scheduling algorithms for optical networks A Aggarwal, A Bar-Noy, D Coppersmith, R Ramaswami, B Schieber, ... Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms …, 1994 | 338* | 1994 |

Collision-Free Hashing from Lattice Problems. O Goldreich, S Goldwasser, S Halevi IACR Cryptology ePrint Archive 1996, 9, 1996 | 323* | 1996 |

Improved low-degree testing and its applications S Arora, M Sudan Combinatorica 23 (3), 365-426, 2003 | 320 | 2003 |

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 | 309 | 2000 |

Approximating minimum feedback sets and multicuts in directed graphs G Even, JS Naor, B Schieber, M Sudan Algorithmica 20 (2), 151-174, 1998 | 304 | 1998 |