Counting distinct elements in a data stream Z Bar-Yossef, TS Jayram, R Kumar, D Sivakumar, L Trevisan Randomization and Approximation Techniques in Computer Science: 6th …, 2002 | 615 | 2002 |

Extractors and pseudorandom generators L Trevisan Journal of the ACM 48 (4), 860-879, 2001 | 531* | 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 | 498 | 1999 |

Multiway spectral partitioning and higher-order cheeger inequalities JR Lee, SO Gharan, L Trevisan Journal of the ACM (JACM) 61 (6), 1-30, 2014 | 412 | 2014 |

On the efficiency of local decoding procedures for error-correcting codes J Katz, L Trevisan Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 359 | 2000 |

Gadgets, approximation, and linear programming L Trevisan, GB Sorkin, M Sudan, DP Williamson SIAM Journal on Computing 29 (6), 2074-2097, 2000 | 350 | 2000 |

Notions of reducibility between cryptographic primitives O Reingold, L Trevisan, S Vadhan Theory of Cryptography Conference, 1-20, 2004 | 323 | 2004 |

Non-approximability results for optimization problems on bounded degree instances L Trevisan Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 267 | 2001 |

Average-case complexity A Bogdanov, L Trevisan Foundations and Trends® in Theoretical Computer Science 2 (1), 1-106, 2006 | 241 | 2006 |

The approximability of constraint satisfaction problems S Khanna, M Sudan, L Trevisan, DP Williamson SIAM Journal on Computing 30 (6), 1863-1920, 2001 | 239 | 2001 |

Extracting randomness from samplable distributions L Trevisan, S Vadhan Proceedings 41st Annual Symposium on Foundations of Computer Science, 32-42, 2000 | 234 | 2000 |

Three theorems regarding testing graph properties O Goldreich, L Trevisan Random Structures & Algorithms 23 (1), 23-57, 2003 | 215 | 2003 |

On worst-case to average-case reductions for NP problems A Bogdanov, L Trevisan SIAM Journal on Computing 36 (4), 1119-1159, 2006 | 198 | 2006 |

A PCP characterization of NP with optimal amortized query complexity A Samorodnitsky, L Trevisan Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 197 | 2000 |

Approximating the minimum spanning tree weight in sublinear time B Chazelle, R Rubinfeld, L Trevisan SIAM Journal on computing 34 (6), 1370-1379, 2005 | 195* | 2005 |

Some applications of coding theory in computational complexity L Trevisan arXiv preprint cs/0409044, 2004 | 188 | 2004 |

Lower bounds on the efficiency of generic cryptographic constructions R Gennaro, L Trevisan Proceedings 41st Annual Symposium on Foundations of Computer Science, 305-313, 2000 | 187 | 2000 |

Pseudorandomness and average-case complexity via uniform reductions L Trevisan, S Vadhan Computational Complexity 16 (4), 331-364, 2007 | 185 | 2007 |

Max cut and the smallest eigenvalue L Trevisan Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 182 | 2009 |

Structure in approximation classes P Crescenzi, V Kann, R Silvestri, L Trevisan SIAM Journal on Computing 28 (5), 1759-1782, 1999 | 164* | 1999 |