Conference on Probabilistic Combinatorics & Algorithms:
a Conference in Honor of Joel Spencer's 60th Birthday

April 24 - 25, 2006
DIMACS Center, CoRE Bldg, Rutgers University, Busch Campus, Piscataway, NJ

Organizers:

Noga Alon, Tel Aviv University and the Institute for Advanced Study, nogaa@post.tau.ac.il

Janos Pach, NYU and Renyi Institute, Budapest, Hungary, pach@cims.nyu.edu

Aravind Srinivasan, University of Maryland, srin@cs.umd.edu

Prasad Tetali, Georgia Tech, tetali@math.gatech.edu

This conference is being held in conjunction with the DIMACS/DIMATIA/Renyi Working Group on Combinatorial Challenges, April 26 - 29, 2006, and conference participants are urged to consider attending both meetings. More information about the DIMACS/DIMATIA/Renyi Working Group on Combinatorial Challenges is available at http://dimacs.rutgers.edu/Workshops/CombChallenge/.

This conference is jointly sponsored by the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), and Microsoft.

Workshop Program:

Monday, April 24, 2006

 9:00 -  9:30  Breakfast and Registration

 9:30 - 10:00  Competition Graphs of Semiorders
               Fred Roberts, Rutgers, DIMACS

10:00 - 10:30  Ramsey theorem for the hypercube
               Benny Sudakov, Princeton University & IAS

10:30 - 11:00  Break

11:00 - 11:30  A lower bound for cooperative broadcast in the presence of noise
               Michael Saks, Rutgers University

11:30 - 12:00  An Algorithmic Approach to Enumeration
               Catherine Yan, Texas A&M

12:00 -  2:00  Lunch

 2:00 -  2:30  Lattice point counting and Markov chains (Part I)
               Jozsef Beck, Rutgers University

 2:30 -  3:00  Deterministic Random Walks on the Integers
               Joshua Cooper, ETH Zurich

 3:00 -  3:30  Break

 3:30 -  4:00  Some results and problems on discrepancy
               Vera T. Sos, Renyi Institute

 4:00 -  4:30  Random Regular Graphs, Random Graphs and Couplings
               Jeong-Han Kim, Microsoft

 4:30 -  5:00  Irregular assignments
               Michal Karonski and Adam Mickiewicz, Emory University

Tuesday, April 25, 2006

 9:00 -  9:30  Breakfast and Registration

 9:30 - 10:00  Peter Winkler, Dartmouth, title TBA

10:00 - 10:30  A balanced property of derangements
               Miklos Bona, University of Florida

10:30 - 11:00  Break

11:00 - 11:30  Random graph models and sampling from graphs
               Laszlo Lovasz, Microsoft

11:30 - 12:00  Coloring Convergent Graph Sequences
               Christian Borgs, Microsoft

12:00 -  2:00  Lunch

 2:00 -  2:30  Simple randomized algorithms for revenue-maximizing auction and pricing problems
               Avrim Blum, CMU

 2:30 -  3:00  Random graphs with given degree distribution
               Fan Chung Graham, UCSD

 3:00 -  3:30  Break

 3:30 -  4:00  Daniel Kleitman, MIT, title TBA

 4:00 -  4:30  Some old and new problems in Ramsey theory 
               Ronald Graham, UCSD

 6:30          Banquet at DIMACS (Dimacs Lounge)
               Joel Spencer: ``I Remember" (brief speech during the banquet)

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage