Papers and preprints:

1. Intersecting Families of Permutations
   ( with David Ellis and Haran Pilpel ) Submitted.

2. Elections Can be Manipulated Often
   ( with Gil Kalai and Noam Nisan ) Submitted.

3. Intersecting families are essentially contained in Juntas
   ( with Irit Dinur ) Submitted.

4. Independent Sets in Graph Powers are Almost Contained in Juntas
   ( with Irit Dinur and Oded Regev ) To appear in G.A.F.A. Funded by I.B.R.M. .

5. * On the measure of intersecting families, uniqueness and stability. To appear in Combinatorica..

6. On the Fourier tails of bounded functions over the discrete cube ( with Irit Dinur and Guy Kindler and Ryan O'Donnell) To appear in Israel Journal of Math..

7. Proof of an intersection theorem via graph homomorphisms
   ( with Irit Dinur ) Electronic Journal of Combinatorics, 13(1) (2006), N6. .

8. A Katona-type proof of an Erdős-Ko-Rado-type theorem
   J.C.T.A. (2005) 111/2 239-244 .
   ...and the "correct" proof found by Yuval Filmus
   

9. * Hunting for Sharp Thresholds.
   Random Structures Algorithms 26 (2005), no. 1-2, 37--51..

10. Buchi complementation made tighter.
    ( with Orna Kupferman and Moshe Vardi ) Proceedings of the 2nd International Symposium on Automated Technology for Verification and Analysis, Lecture Notes in Computer Science, Springer-Verlag 2004 ..

11. On the Number of Hamiltonian Cycles in a Tournament.
    ( with Jeff Kahn) Combinatorics Probability and Computing, 14 (2005), no. 5-6, 769--781.

12. Hypergraphs, Entropy and Inequalities. The American Mathematical Monthly, 111 (2004), no. 9, 749--760..

13. Ramsey games against a one-armed bandit
    ( with Yoshi Kohayakawa Vojtech Rödl , Prasad Tetali and Andrzej Rucinski ) Combinatorics, Probability and Computing 12 (2003), no. 5-6, 515--545..

14. * Graph Products, Fourier Analysis and Spectral Techniques ( with Noga Alon , Irit Dinur and Benny Sudakov ) G.A.F.A. 14 (2004), no. 5, 913--940..

15. * Random Graphs with a Monochromatic Triangle in Every Edge Coloring; A Sharp Threshold. ( with Vojtech Rödl Prasad Tetali and Andrzej Rucinski ) To appear in Memoirs of the A.M.S..

16. Boolean Functions whose Fourier Transform is Concentrated on the First Two Levels
    ( with Gil Kalai and Assaf Naor ) Adv. in Appl. Math., 29(2002), 427-437.

17. * Computing Graph Properties by Randomized Subcube Partitions
    ( with Avi Wigderson and Jeff Kahn ) Randomization and Approximation Techniques in Computer Science, 6th International Workshop, RANDOM 2002, pp. 105-113, 2002 .

18. Influences in Product Spaces, KKL and BKKKL Revisited Combinatorics Probability and Computing, 13 (2004), no. 1, 17--29. .

19. Proof of a Hypercontractive Estimate via Entropy
    ( with Vojtech Rödl) Israel J. Math. 125 (2001), 369--380 .

20. On the Number of Permutations avoiding a Pattern
    ( with Noga Alon) J. Combin. Theory Ser. A 89 (2000), no. 1, 133--140. .

21. Ramsey Properties of Random Graphs
    ( with Michael Krivelevich ) (Abstract)
    Random Structures Algorithms 17 (2000), no. 1, 1--19 .

22. A Sharp Threshold for $k$-Colorability
    ( with Dimitris Achlioptas) Random Structures and Algorithms, Vol 14, 1 (1999) pp 63-70.

23. On the Number of Copies of One Hypergraph in Another
    ( with Jeff Kahn) Israel Journal of Mathematics Vol. 105 (1998) pp. 251-256. .

24. Sharp Thresholds of Graph Proprties, and the $k$-sat Problem. J. Amer. Math. Soc. 12 (1999), no. 4, 1017--1054. .

25. Appendix to above paper, by Jean Bourgain.

26. Boolean Functions with Low Average Sensitivity Depend on Few coordinates. Combinatorica Vol 18 (1) 1998 pp. 27-36..

27. Every Monotone Graph Property Has a Sharp Threshold.
    ( with Gil Kalai), Proc. Amer. Math. Soc. 124 (1996), pp. 2993-3002 . .

    Presentations:

    What makes a graph Ramsey?

    Coloring graph products.

    On the measure of intersecting families via spectral methods.
    (Has some snags if not viewed with PowerPoint 2003 and up.)

    Hunting for Sharp Thresholds.