Ehud Friedgut

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