Ehud Friedgut

According to our database1, Ehud Friedgut authored at least 25 papers between 1998 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Chvátal's conjecture and correlation inequalities.
J. Comb. Theory, Ser. A, 2018

2016
Juntas in the 1-grid and Lipschitz maps between discrete tori.
Random Struct. Algorithms, 2016

2015
A stability result for balanced dictatorships in Sn.
Random Struct. Algorithms, 2015

Thresholds and Expectation-Thresholds of Monotone Properties with Small Minterms.
Electr. J. Comb., 2015

A quasi-stability result for dictatorships in S n.
Combinatorica, 2015

2013
Sisterhood in the Gale-Shapley Matching Algorithm.
Electr. J. Comb., 2013

2011
A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives.
SIAM J. Comput., 2011

An Algebraic Proof of a Robust Social Choice Impossibility Theorem.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Ramsey properties of random discrete structures.
Random Struct. Algorithms, 2010

2009
Intersecting Families are Essentially Contained in Juntas.
Combinatorics, Probability & Computing, 2009

2008
On the measure of intersecting families, uniqueness and stability.
Combinatorica, 2008

Elections Can be Manipulated Often.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2006
Proof of an Intersection Theorem via Graph Homomorphisms.
Electr. J. Comb., 2006

On the fourier tails of bounded functions over the discrete cube.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005
Hunting for sharp thresholds.
Random Struct. Algorithms, 2005

A Katona-type proof of an Erdos-Ko-Rado-type theorem.
J. Comb. Theory, Ser. A, 2005

2004
Hypergraphs, Entropy, and Inequalities.
The American Mathematical Monthly, 2004

Influences in Product Spaces: KKL and BKKKL Revisited.
Combinatorics, Probability & Computing, 2004

Büchi Complementation Made Tighter.
Proceedings of the Automated Technology for Verification and Analysis: Second International Conference, 2004

2003
Ramsey Games Against a One-Armed Bandit.
Combinatorics, Probability & Computing, 2003

2002
Computing Graph Properties by Randomized Subcube Partitions.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

2000
Sharp thresholds for certain Ramsey properties of random graphs.
Random Struct. Algorithms, 2000

On the Number of Permutations Avoiding a Given Pattern.
J. Comb. Theory, Ser. A, 2000

1999
A Sharp Threshold for k-Colorability.
Random Struct. Algorithms, 1999

1998
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates.
Combinatorica, 1998


  Loading...