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

Noga Alon, Tel Aviv University and the Institute for Advanced Study,
Janos Pach, NYU and Renyi Institute, Budapest, Hungary,
Aravind Srinivasan, University of Maryland,
Prasad Tetali, Georgia Tech,
Presented under the auspices of the Special Focus on Discrete Random Systems.

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

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

Professor Joel Spencer has been a leading figure in the research and exposition of probabilistic combinatorics. His research in various areas including Ramsey theory, discrepancy theory, random graphs (and connections to logic), randomized greedy methods, etc. have set the tone for the field for more than three decades. Professor Spencer has also influenced a whole generation of researchers in discrete math and computer science through his very well-known books, his lectures, and inspiring personality. This conference will celebrate Professor Spencer's 60th birthday, through a number of talks that will cover several of Professor Spencer's research areas. There will also be ample time for discussions; junior researchers and students are particularly encouraged to attend.

The registration includes a banquet on Tuesday evening, April 25, 2006, which will include short talks by various speakers on Joel Spencer's work and influence.

Next: Call for Participation
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on March 27, 2006.