Boolean Functions With Low Average Sensitivity Depend On Few Coordinates. - Ehud Friedgut (Comb., 1998)

A Sharp Threshold for k-Colorability. - Dimitris Achlioptas; Ehud Friedgut (Random Struct. Algorithms, 1999)

On the Number of Permutations Avoiding a Given Pattern. - Noga Alon; Ehud Friedgut (J. Comb. Theory A, 2000)

Sharp thresholds for certain Ramsey properties of random graphs. - Ehud Friedgut; Michael Krivelevich (Random Struct. Algorithms, 2000)

Computing Graph Properties by Randomized Subcube Partitions. - Ehud Friedgut; Jeff Kahn 001; Avi Wigderson (RANDOM, 2002)

Boolean functions whose Fourier transform is concentrated on the first two levels. - Ehud Friedgut; Gil Kalai; Assaf Naor (Adv. Appl. Math., 2002)

Ramsey Games Against a One-Armed Bandit. - Ehud Friedgut; Yoshiharu Kohayakawa; Vojtech Rödl; Andrzej Rucinski 001; Prasad Tetali (Comb. Probab. Comput., 2003)

Influences in Product Spaces: KKL and BKKKL Revisited. - Ehud Friedgut (Comb. Probab. Comput., 2004)

Hypergraphs, Entropy, and Inequalities. - Ehud Friedgut (Am. Math. Mon., 2004)

A Katona-type proof of an Erdos-Ko-Rado-type theorem. - Ehud Friedgut (J. Comb. Theory A, 2005)

Hunting for sharp thresholds. - Ehud Friedgut (Random Struct. Algorithms, 2005)

A sharp threshold for random graphs with a monochromatic triangle in every edge coloring. - Ehud Friedgut; Vojtech Rödl; Andrzej Rucinski 001; Prasad Tetali (American Mathematical Society, 2006)

On the fourier tails of bounded functions over the discrete cube. - Irit Dinur; Ehud Friedgut; Guy Kindler; Ryan O'Donnell (STOC, 2006)

Proof of an Intersection Theorem via Graph Homomorphisms. - Irit Dinur; Ehud Friedgut (Electron. J. Comb., 2006)

Büchi Complementation Made Tighter. - Ehud Friedgut; Orna Kupferman; Moshe Y. Vardi (Int. J. Found. Comput. Sci., 2006)

Elections Can be Manipulated Often. - Ehud Friedgut; Gil Kalai; Noam Nisan (FOCS, 2008)

On the measure of intersecting families, uniqueness and stability. - Ehud Friedgut (Comb., 2008)

Intersecting Families are Essentially Contained in Juntas. - Irit Dinur; Ehud Friedgut (Comb. Probab. Comput., 2009)

Ramsey properties of random discrete structures. - Ehud Friedgut; Vojtech Rödl; Mathias Schacht (Random Struct. Algorithms, 2010)

An Algebraic Proof of a Robust Social Choice Impossibility Theorem. - Dvir Falik; Ehud Friedgut (FOCS, 2011)

A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. - Ehud Friedgut; Gil Kalai; Nathan Keller; Noam Nisan (SIAM J. Comput., 2011)

Between Arrow and Gibbard-Satterthwaite; A representation theoretic approach - Dvir Falik; Ehud Friedgut (CoRR, 2012)

Sisterhood in the Gale-Shapley Matching Algorithm. - Yannai A. Gonczarowski; Ehud Friedgut (Electron. J. Comb., 2013)

A quasi-stability result for dictatorships in S n. - David Ellis; Yuval Filmus; Ehud Friedgut (Comb., 2015)

Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms. - Ehud Friedgut; Jeff Kahn 001; Clara Shikhelman (Electron. J. Comb., 2015)

Geometric stability via information theory. - David Ellis; Ehud Friedgut; Guy Kindler; Amir Yehudayoff (CoRR, 2015)

A stability result for balanced dictatorships in Sn. - David Ellis; Yuval Filmus; Ehud Friedgut (Random Struct. Algorithms, 2015)

Juntas in the ℓ1-grid and Lipschitz maps between discrete tori. - Itai Benjamini; David Ellis; Ehud Friedgut; Nathan Keller; Arnab Sen (Random Struct. Algorithms, 2016)

Chvátal's conjecture and correlation inequalities. - Ehud Friedgut; Jeff Kahn 001; Gil Kalai; Nathan Keller (J. Comb. Theory A, 2018)

The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs. - Noga Alon; Ehud Friedgut; Gil Kalai; Guy Kindler (SIAM J. Discret. Math., 2023)

On the maximum degree of induced subgraphs of the Kneser graph. - Hou Tin Chau; David Ellis; Ehud Friedgut; Noam Lifshitz (Comb. Theory, 2025)