Ehud Friedgut

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 3

Top Topics

Positively Correlated

Statistical Mechanics

Cutting Plane Algorithm

Shannon Entropy

Top Venues

Electron. J. Comb.

Random Struct. Algorithms

J. Comb. Theory, Ser. A

Publications

Noga Alon, Ehud Friedgut, Gil Kalai, Guy Kindler
The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs. SIAM J. Discret. Math. 37 (4) (2023)
Ehud Friedgut, Jeff Kahn, Gil Kalai, Nathan Keller
Chvátal's conjecture and correlation inequalities. J. Comb. Theory, Ser. A 156 (2018)
Itai Benjamini, David Ellis, Ehud Friedgut, Nathan Keller, Arnab Sen
-grid and Lipschitz maps between discrete tori. Random Struct. Algorithms 49 (2) (2016)
David Ellis, Yuval Filmus, Ehud Friedgut
A quasi-stability result for dictatorships in S n. Comb. 35 (5) (2015)
Ehud Friedgut, Jeff Kahn, Clara Shikhelman
Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms. Electron. J. Comb. 22 (2) (2015)
David Ellis, Yuval Filmus, Ehud Friedgut
. Random Struct. Algorithms 46 (3) (2015)
David Ellis, Ehud Friedgut, Guy Kindler, Amir Yehudayoff
Geometric stability via information theory. CoRR (2015)
Yannai A. Gonczarowski, Ehud Friedgut
Sisterhood in the Gale-Shapley Matching Algorithm. Electron. J. Comb. 20 (2) (2013)
Dvir Falik, Ehud Friedgut
Between Arrow and Gibbard-Satterthwaite; A representation theoretic approach CoRR (2012)
Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives CoRR (2011)
Yannai A. Gonczarowski, Ehud Friedgut
On Sisterhood in the Gale-Shapley Matching Algorithm CoRR (2011)
Dvir Falik, Ehud Friedgut
An Algebraic Proof of a Robust Social Choice Impossibility Theorem. FOCS (2011)
Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. SIAM J. Comput. 40 (3) (2011)
Ehud Friedgut, Vojtech Rödl, Mathias Schacht
Ramsey properties of random discrete structures. Random Struct. Algorithms 37 (4) (2010)
Irit Dinur, Ehud Friedgut
Intersecting Families are Essentially Contained in Juntas. Comb. Probab. Comput. 18 (1-2) (2009)
Ehud Friedgut
On the measure of intersecting families, uniqueness and stability. Comb. 28 (5) (2008)
Ehud Friedgut, Gil Kalai, Noam Nisan
Elections Can be Manipulated Often. FOCS (2008)
Irit Dinur, Ehud Friedgut
Proof of an Intersection Theorem via Graph Homomorphisms. Electron. J. Comb. 13 (1) (2006)
Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi
Büchi Complementation Made Tighter. Int. J. Found. Comput. Sci. 17 (4) (2006)
Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell
On the fourier tails of bounded functions over the discrete cube. STOC (2006)
Ehud Friedgut
Hunting for sharp thresholds. Random Struct. Algorithms 26 (1-2) (2005)
Ehud Friedgut
A Katona-type proof of an Erdos-Ko-Rado-type theorem. J. Comb. Theory, Ser. A 111 (2) (2005)
Ehud Friedgut
Influences in Product Spaces: KKL and BKKKL Revisited. Comb. Probab. Comput. 13 (1) (2004)
Ehud Friedgut
Hypergraphs, Entropy, and Inequalities. Am. Math. Mon. 111 (9) (2004)
Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi
Büchi Complementation Made Tighter. ATVA (2004)
Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
Ramsey Games Against a One-Armed Bandit. Comb. Probab. Comput. 12 (5-6) (2003)
Ehud Friedgut, Jeff Kahn, Avi Wigderson
Computing Graph Properties by Randomized Subcube Partitions. RANDOM (2002)
Ehud Friedgut, Gil Kalai, Assaf Naor
Boolean functions whose Fourier transform is concentrated on the first two levels. Adv. Appl. Math. 29 (3) (2002)
Noga Alon, Ehud Friedgut
On the Number of Permutations Avoiding a Given Pattern. J. Comb. Theory, Ser. A 89 (1) (2000)
Ehud Friedgut, Michael Krivelevich
Sharp thresholds for certain Ramsey properties of random graphs. Random Struct. Algorithms 17 (1) (2000)
Dimitris Achlioptas, Ehud Friedgut
A Sharp Threshold for k-Colorability. Random Struct. Algorithms 14 (1) (1999)
Ehud Friedgut
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates. Comb. 18 (1) (1998)