Ehud Friedgut

According to our database, Ehud Friedgut authored at least 30 papers between 1998 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

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., December, 2023

2018

Chvátal's conjecture and correlation inequalities.

Ehud Friedgut, Jeff Kahn, Gil Kalai, Nathan Keller

J. Comb. Theory A, 2018

2016

Juntas in the <i>ℓ</i>₁-grid and Lipschitz maps between discrete tori.

Itai Benjamini, David Ellis, Ehud Friedgut, Nathan Keller, Arnab Sen

Random Struct. Algorithms, 2016

2015

A stability result for balanced dictatorships in S_n.

David Ellis, Yuval Filmus, Ehud Friedgut

Random Struct. Algorithms, 2015

Geometric stability via information theory.

David Ellis, Ehud Friedgut, Guy Kindler, Amir Yehudayoff

CoRR, 2015

Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms.

Ehud Friedgut, Jeff Kahn, Clara Shikhelman

Electron. J. Comb., 2015

A quasi-stability result for dictatorships in S n.

David Ellis, Yuval Filmus, Ehud Friedgut

Comb., 2015

2013

Sisterhood in the Gale-Shapley Matching Algorithm.

Yannai A. Gonczarowski, Ehud Friedgut

Electron. J. Comb., 2013

2012

Between Arrow and Gibbard-Satterthwaite; A representation theoretic approach

Dvir Falik, Ehud Friedgut

CoRR, 2012

2011

A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives.

Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan

SIAM J. Comput., 2011

An Algebraic Proof of a Robust Social Choice Impossibility Theorem.

Dvir Falik, Ehud Friedgut

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Ramsey properties of random discrete structures.

Ehud Friedgut, Vojtech Rödl, Mathias Schacht

Random Struct. Algorithms, 2010

2009

Intersecting Families are Essentially Contained in Juntas.

Irit Dinur, Ehud Friedgut

Comb. Probab. Comput., 2009

2008

On the measure of intersecting families, uniqueness and stability.

Ehud Friedgut

Comb., 2008

Elections Can be Manipulated Often.

Ehud Friedgut, Gil Kalai, Noam Nisan

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2006

Büchi Complementation Made Tighter.

Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi

Int. J. Found. Comput. Sci., 2006

Proof of an Intersection Theorem via Graph Homomorphisms.

Irit Dinur, Ehud Friedgut

Electron. J. Comb., 2006

On the fourier tails of bounded functions over the discrete cube.

Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

A sharp threshold for random graphs with a monochromatic triangle in every edge coloring.

Ehud Friedgut, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali

Memoirs of the American Mathematical Society 845, American Mathematical Society, ISBN: 978-0-8218-3825-9, 2006

2005

Hunting for sharp thresholds.

Ehud Friedgut

Random Struct. Algorithms, 2005

A Katona-type proof of an Erdos-Ko-Rado-type theorem.

Ehud Friedgut

J. Comb. Theory A, 2005

2004

Hypergraphs, Entropy, and Inequalities.

Ehud Friedgut

Am. Math. Mon., 2004

Influences in Product Spaces: KKL and BKKKL Revisited.

Ehud Friedgut

Comb. Probab. Comput., 2004

2003

Ramsey Games Against a One-Armed Bandit.

Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali

Comb. Probab. Comput., 2003

2002

Boolean functions whose Fourier transform is concentrated on the first two levels.

Ehud Friedgut, Gil Kalai, Assaf Naor

Adv. Appl. Math., 2002

Computing Graph Properties by Randomized Subcube Partitions.

Ehud Friedgut, Jeff Kahn, Avi Wigderson

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

2000

Sharp thresholds for certain Ramsey properties of random graphs.

Ehud Friedgut, Michael Krivelevich

Random Struct. Algorithms, 2000

On the Number of Permutations Avoiding a Given Pattern.

Noga Alon, Ehud Friedgut

J. Comb. Theory A, 2000

1999

A Sharp Threshold for k-Colorability.

Dimitris Achlioptas, Ehud Friedgut

Random Struct. Algorithms, 1999

1998

Boolean Functions With Low Average Sensitivity Depend On Few Coordinates.

Ehud Friedgut

Comb., 1998