Ehud Friedgut
Loading Google Thumbnails...
| 2009 |
|---|
| 7 | Intersecting Families are Essentially Contained in Juntas. Irit Dinur, Ehud Friedgut. Combinatorics, Probability & Computing (18): 107-122 (2009). Web SearchBibTeXDownload |
| 2006 |
|---|
| 6 | Proof of an Intersection Theorem via Graph Homomorphisms. Irit Dinur, Ehud Friedgut. Electr. J. Comb. (13) (2006). Web SearchBibTeXDownload |
| 5 | Büchi Complementation Made Tighter. Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi. Int. J. Found. Comput. Sci. (17): 851-868 (2006). Cited by 25Web SearchBibTeXDownload |
| 4 | On the fourier tails of bounded functions over the discrete cube. Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell. STOC 2006, 437-446. Web SearchBibTeXDownload |
| 2004 |
|---|
| 3 | Büchi Complementation Made Tighter. Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi. ATVA 2004, 64-78. Cited by 25Web SearchBibTeXDownload |
| 2000 |
|---|
| 2 | On the Number of Permutations Avoiding a Given Pattern. Noga Alon, Ehud Friedgut. J. Comb. Theory, Ser. A (89): 133-140 (2000). Web SearchBibTeXDownload |
| 1999 |
|---|
| 1 | A Sharp Threshold for k-Colorability. Dimitris Achlioptas, Ehud Friedgut. Random Struct. Algorithms (14): 63-70 (1999). Web SearchBibTeX |
from DBLP and Google Scholar
