Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ehud Friedgut
2010 – today
- 2013
[j16]Yannai A. Gonczarowski, Ehud Friedgut: Sisterhood in the Gale-Shapley Matching Algorithm. Electr. J. Comb. 20(2): P12 (2013)- 2012
- [i3]Dvir Falik, Ehud Friedgut: Between Arrow and Gibbard-Satterthwaite; A representation theoretic approach. CoRR abs/1203.3368 (2012)
- 2011
- [j15]Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan: A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. SIAM J. Comput. 40(3): 934-952 (2011)
- [c5]Dvir Falik, Ehud Friedgut: An Algebraic Proof of a Robust Social Choice Impossibility Theorem. FOCS 2011: 413-422
- [i2]Yannai A. Gonczarowski, Ehud Friedgut: On Sisterhood in the Gale-Shapley Matching Algorithm. CoRR abs/1104.2217 (2011)
- [i1]Ehud Friedgut, Gil Kalai, Nathan Keller, Noam Nisan: A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives. CoRR abs/1105.5129 (2011)
- 2010
- [j14]Ehud Friedgut, Vojtech Rödl, Mathias Schacht: Ramsey properties of random discrete structures. Random Struct. Algorithms 37(4): 407-436 (2010)
2000 – 2009
- 2009
- [j13]Irit Dinur, Ehud Friedgut: Intersecting Families are Essentially Contained in Juntas. Combinatorics, Probability & Computing 18(1-2): 107-122 (2009)
- 2008
- [j12]Ehud Friedgut: On the measure of intersecting families, uniqueness and stability. Combinatorica 28(5): 503-528 (2008)
- [c4]
- 2006
- [j11]Irit Dinur, Ehud Friedgut: Proof of an Intersection Theorem via Graph Homomorphisms. Electr. J. Comb. 13(1) (2006)
- [j10]Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi: Büchi Complementation Made Tighter. Int. J. Found. Comput. Sci. 17(4): 851-868 (2006)
- [c3]Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell: On the fourier tails of bounded functions over the discrete cube. STOC 2006: 437-446
- 2005
- [j9]Ehud Friedgut: A Katona-type proof of an Erdos-Ko-Rado-type theorem. J. Comb. Theory, Ser. A 111(2): 239-244 (2005)
- [j8]
- 2004
- [j7]Ehud Friedgut: Influences in Product Spaces: KKL and BKKKL Revisited. Combinatorics, Probability & Computing 13(1): 17-29 (2004)
- [j6]Ehud Friedgut: Hypergraphs, Entropy, and Inequalities. The American Mathematical Monthly 111(9): 749-760 (2004)
- [c2]
- 2003
- [j5]Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali: Ramsey Games Against a One-Armed Bandit. Combinatorics, Probability & Computing 12(5-6): 515-545 (2003)
- 2002
- [c1]Ehud Friedgut, Jeff Kahn, Avi Wigderson: Computing Graph Properties by Randomized Subcube Partitions. RANDOM 2002: 105-113
- 2000
- [j4]Noga Alon, Ehud Friedgut: On the Number of Permutations Avoiding a Given Pattern. J. Comb. Theory, Ser. A 89(1): 133-140 (2000)
- [j3]Ehud Friedgut, Michael Krivelevich: Sharp thresholds for certain Ramsey properties of random graphs. Random Struct. Algorithms 17(1): 1-19 (2000)
1990 – 1999
- 1999
- [j2]Dimitris Achlioptas, Ehud Friedgut: A Sharp Threshold for k-Colorability. Random Struct. Algorithms 14(1): 63-70 (1999)
- 1998
- [j1]Ehud Friedgut: Boolean Functions With Low Average Sensitivity Depend On Few Coordinates. Combinatorica 18(1): 27-35 (1998)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-14 22:40 CEST by the dblp team