| 2009 |
| 15 | EE | Irit Dinur,
Ehud Friedgut:
Intersecting Families are Essentially Contained in Juntas.
Combinatorics, Probability & Computing 18(1-2): 107-122 (2009) |
| 2008 |
| 14 | EE | Ehud Friedgut,
Gil Kalai,
Noam Nisan:
Elections Can be Manipulated Often.
FOCS 2008: 243-249 |
| 2006 |
| 13 | EE | Irit Dinur,
Ehud Friedgut,
Guy Kindler,
Ryan O'Donnell:
On the fourier tails of bounded functions over the discrete cube.
STOC 2006: 437-446 |
| 12 | EE | Irit Dinur,
Ehud Friedgut:
Proof of an Intersection Theorem via Graph Homomorphisms.
Electr. J. Comb. 13(1): (2006) |
| 11 | EE | Ehud Friedgut,
Orna Kupferman,
Moshe Y. Vardi:
Büchi Complementation Made Tighter.
Int. J. Found. Comput. Sci. 17(4): 851-868 (2006) |
| 2005 |
| 10 | EE | Ehud Friedgut:
A Katona-type proof of an Erdos-Ko-Rado-type theorem.
J. Comb. Theory, Ser. A 111(2): 239-244 (2005) |
| 9 | EE | Ehud Friedgut:
Hunting for sharp thresholds.
Random Struct. Algorithms 26(1-2): 37-51 (2005) |
| 2004 |
| 8 | EE | Ehud Friedgut,
Orna Kupferman,
Moshe Y. Vardi:
Büchi Complementation Made Tighter.
ATVA 2004: 64-78 |
| 7 | | Ehud Friedgut:
Influences in Product Spaces: KKL and BKKKL Revisited.
Combinatorics, Probability & Computing 13(1): 17-29 (2004) |
| 2003 |
| 6 | | Ehud Friedgut,
Yoshiharu Kohayakawa,
Vojtech Rödl,
Andrzej Rucinski,
Prasad Tetali:
Ramsey Games Against a One-Armed Bandit.
Combinatorics, Probability & Computing 12(5-6): 515-545 (2003) |
| 2002 |
| 5 | EE | Ehud Friedgut,
Jeff Kahn,
Avi Wigderson:
Computing Graph Properties by Randomized Subcube Partitions.
RANDOM 2002: 105-113 |
| 2000 |
| 4 | EE | Noga Alon,
Ehud Friedgut:
On the Number of Permutations Avoiding a Given Pattern.
J. Comb. Theory, Ser. A 89(1): 133-140 (2000) |
| 3 | | Ehud Friedgut,
Michael Krivelevich:
Sharp thresholds for certain Ramsey properties of random graphs.
Random Struct. Algorithms 17(1): 1-19 (2000) |
| 1999 |
| 2 | | Dimitris Achlioptas,
Ehud Friedgut:
A Sharp Threshold for k-Colorability.
Random Struct. Algorithms 14(1): 63-70 (1999) |
| 1998 |
| 1 | EE | Ehud Friedgut:
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates.
Combinatorica 18(1): 27-35 (1998) |