| Sharp thresholds of graph properties, and the 𝑘-sat problem E Friedgut, J Bourgain Journal of the American mathematical Society 12 (4), 1017-1054, 1999 | 751 | 1999 |
| Every monotone graph property has a sharp threshold E Friedgut, G Kalai Proceedings of the American mathematical Society 124 (10), 2993-3002, 1996 | 463 | 1996 |
| Boolean functions with low average sensitivity depend on few coordinates E Friedgut Combinatorica 18 (1), 27-35, 1998 | 257 | 1998 |
| A Sharp Threshold for k‐Colorability D Achlioptas, E Friedgut Random Structures & Algorithms 14 (1), 63-70, 1999 | 167 | 1999 |
| Intersecting families of permutations D Ellis, E Friedgut, H Pilpel Journal of the American Mathematical Society 24 (3), 649-682, 2011 | 165 | 2011 |
| Elections can be manipulated often E Friedgut, G Kalai, N Nisan 2008 49th Annual IEEE symposium on foundations of computer science, 243-249, 2008 | 133 | 2008 |
| Boolean functions whose Fourier transform is concentrated on the first two levels E Friedgut, G Kalai, A Naor Advances in Applied Mathematics 29 (3), 427-437, 2002 | 120 | 2002 |
| Hunting for sharp thresholds E Friedgut Random Structures & Algorithms 26 (1‐2), 37-51, 2005 | 101 | 2005 |
| Graph products, Fourier analysis and spectral techniques N Alon, I Dinur, E Friedgut, B Sudakov Geometric & Functional Analysis GAFA 14, 913-940, 2004 | 93 | 2004 |
| On the measure of intersecting families, uniqueness and stability E Friedgut Combinatorica 28 (5), 503-528, 2008 | 92 | 2008 |
| Büchi complementation made tighter E Friedgut, O Kupferman, MY Vardi International Journal of Foundations of Computer Science 17 (04), 851-867, 2006 | 81 | 2006 |
| On the Fourier tails of bounded functions over the discrete cube I Dinur, E Friedgut, G Kindler, R O'Donnell Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 76 | 2006 |
| Ramsey games against a one-armed bandit E Friedgut, Y Kohayakawa, V Rodl, A Rucinski, P Tetali Combinatorics, Probability and Computing 12 (5-6), 515-545, 2003 | 71 | 2003 |
| Hypergraphs, entropy, and inequalities E Friedgut The American Mathematical Monthly 111 (9), 749-760, 2004 | 69 | 2004 |
| On the number of permutations avoiding a given pattern N Alon, E Friedgut J. Comb. Theory, Ser. A 89 (1), 133-140, 2000 | 69 | 2000 |
| On the number of copies of one hypergraph in another E Friedgut, J Kahn Israel Journal of Mathematics 105 (1), 251-256, 1998 | 68 | 1998 |
| Ramsey properties of random discrete structures E Friedgut, V Rödl, M Schacht Random Structures & Algorithms 37 (4), 407-436, 2010 | 67 | 2010 |
| Intersecting families are essentially contained in juntas I Dinur, E Friedgut Combinatorics, Probability and Computing 18 (1-2), 107-122, 2009 | 65 | 2009 |
| Necessary and suficient conditions for sharp thresholds," E Friedgut Manuscript in preparation, 1997 | 61 | 1997 |
| Triangle-intersecting families of graphs D Ellis, Y Filmus, E Friedgut Journal of the European mathematical society 14 (3), 841-885, 2012 | 51 | 2012 |
