DIMACS Center, CoRE Building, Rutgers University

**Organizers:****Noga Alon**, Tel Aviv University, noga@math.tau.ac.il**Joel Spencer**, NYU, spencer@cs.nyu.edu

MONDAY, October 14, 19969:15-9:30 Welcome to DIMACS Fred Roberts, DIMACS Director 9:30-10:15 Bela Bollobas Memphis University and University of CambridgeColourings Generated by Monotone Properties10:15-10:45 Coffee 10:45-11:30 Michel Talagrand CNRS and Ohio State UniversityConcentration of measure and combinatorics: what is the final word?12:00- 2:00 Lunch 2:00- 2:25 Joel Spencer Courant InstituteAn asymptotic isoperimetric inequality2:30- 2:55 Boris Pittel Ohio State UniversityMaximum matchings in sparse random graphs: Karp--Sipser re-visited.3:00- 3:30 Coffee 3:30- 4:15 Tomasz Luczak Emory University and Adam Mickiewicz UniversityExtremal properties of random sets6:00 - ReceptionTUESDAY, October 15 , 19969:30-10:15 Amir Dembo Stanford University and the TechnionInformation inequalities and concentration of measure10:15-10:45 Coffee 10:45-11:10 Bruce Reed CNRS $\omega,\Delta,\chi$. 11:15-11:45 Mike Molloy University of TorontoA Bound on the Total Chromatic Number12:00- 2:00 Lunch 2:00- 2:25 Alexander Kostochka Russian Academy of SciencesOriented colorings of graphs2:30- 2:55 Donovan Hare Okanagan University CollegeArithmetic Progressions in Sequences With Bounded Gaps3:00- 3:30 Coffee 3:30- DiscussionWEDNESDAY, October 16, 19969:30-10:15 Vojtech Rodl Emory UniversityPartition properties of Random Structures10:15-10:45 Coffee 10:45-11:30 Robin Pemantle University of Wisconsis-MadisonExponentially separated paths and application to oriented percolationTHURSDAY, October 17, 19969:30-10:15 Zoltan Furedi University of IllinoisThe expected size of a random sphere-of-influence graph10:15-10:45 Coffee 10:45-11:30 Jeong Han Kim AT & TRandom Coverings of the n-Dimensional Cube12:00-14:00 Lunch 2:00- 2:25 Aravind Srinivasan National University of SingaporeImproving the discrepancy bound for sparse matrices: better approximations for sparse integer programs2:30- 2:55 Paul Spirakis Computer Technology Institute, GreeceGenetic probabilistic methods for almost uniform generation in parallel.3:00- 3:30 Coffee 3:30- 3:55 Sotiris Nikoletseas Computer Technology Institute, GreeceStochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time4:00- 5:00 Problem sessionFRIDAY, October 18, 19969:30-9:55 Ljubomir Perkovic Carnegie Mellon UniversityEdge Coloring in polynomial time (on average)10:00-10:25 Nabil Kahale AT & TA semidefinite bound for mixing rates of Markov chains10:25-10:45 Coffee 10:45-11:30 Colin McDiarmid Oxford UniversityFinding a minimum spanning tree in a network with random weights12:00- 2:00 Lunch 2:00- 2:25 Igor Pak Harvard UniversityRandom walks on groups: strong stationary times approach.

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage

Contacting the Center

Document last modified on October 8, 1996.