L. Fortnow: The Computational Complexity Column Recent Developments in Explicit Constructions of Extractors R Shaltiel BULLETIN-European Association For Theoretical Computer Science 77, 67-95, 2002 | 375* | 2002 |

2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction B Barak, A Rao, R Shaltiel, A Wigderson Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 165* | 2006 |

True random number generators secure in a changing environment B Barak, R Shaltiel, E Tromer International Workshop on Cryptographic Hardware and Embedded Systems, 166-180, 2003 | 151 | 2003 |

Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors B Barak, G Kindler, R Shaltiel, B Sudakov, A Wigderson Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 131 | 2005 |

Simple extractors for all min-entropies and a new pseudo-random generator R Shaltiel, C Umans Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 648-657, 2001 | 129 | 2001 |

Computational analogues of entropy B Barak, R Shaltiel, A Wigderson Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003 | 117 | 2003 |

Simple extractors for all min-entropies and a new pseudorandom generator R Shaltiel, C Umans Journal of the ACM (JACM) 52 (2), 172-216, 2005 | 113 | 2005 |

Extracting randomness via repeated condensing O Reingold, R Shaltiel, A Wigderson SIAM Journal on Computing 35 (5), 1185-1209, 2006 | 111 | 2006 |

Deterministic extractors for bit-fixing sources by obtaining an independent seed A Gabizon, R Raz, R Shaltiel SIAM Journal on Computing 36 (4), 1072-1094, 2006 | 110 | 2006 |

Towards proving strong direct product theorems R Shaltiel Proceedings 16th Annual IEEE Conference on Computational Complexity, 107-117, 2001 | 98 | 2001 |

An introduction to randomness extractors R Shaltiel International colloquium on automata, languages, and programming, 21-41, 2011 | 90 | 2011 |

Extractors and pseudo-random generators with optimal seed length R Impagliazzo, R Shaltiel, A Wigderson Proceedings of the thirty-second annual ACM symposium on theory of computing …, 2000 | 85 | 2000 |

Hardness amplification proofs require majority R Shaltiel, E Viola SIAM Journal on Computing 39 (7), 3122-3154, 2010 | 83 | 2010 |

Constant-round oblivious transfer in the bounded storage model YZ Ding, D Harnik, A Rosen, R Shaltiel Theory of Cryptography Conference, 446-472, 2004 | 76 | 2004 |

Mining circuit lower bound proofs for meta-algorithms R Chen, V Kabanets, A Kolokolova, R Shaltiel, D Zuckerman Computational Complexity 24 (2), 333-392, 2015 | 65 | 2015 |

If NP languages are hard on the worst-case, then it is easy to find their hard instances D Gutfreund, R Shaltiel, A Ta-Shma Computational Complexity 16 (4), 412-441, 2007 | 65 | 2007 |

Pseudorandomness for approximate counting and sampling R Shaltiel, C Umans computational complexity 15 (4), 298-341, 2006 | 64 | 2006 |

Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors B Barak, G Kindler, R Shaltiel, B Sudakov, A Wigderson Journal of the ACM (JACM) 57 (4), 1-52, 2010 | 58 | 2010 |

Reducing complexity assumptions for statistically-hiding commitment I Haitner, O Horvitz, J Katz, CY Koo, R Morselli, R Shaltiel Annual International Conference on the Theory and Applications of …, 2005 | 58 | 2005 |

Near-optimal conversion of hardness into pseudo-randomness R Impagliazzo, R Shaltiel, A Wigderson 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999 | 57 | 1999 |