8:30 a.m. The Phase Diagram of the Biased Integer Partitioning Problem. Christian Borgs, Microsoft Research
Jennifer Tour Chayes*, Microsoft Research
Stephan Mertens, Universitaet Magdeburg
Boris Pittel, Ohio State University
(983-68-912)
9:00 a.m. Gibbs Extremality for the Hard-Core Model on a Bethe Lattice. Graham R. Brightwell, London School of Economics
Peter Winkler*, Bell Labs, Lucent Technologies
(983-82-1048)
9:30 a.m. The Rotor-Router Model. Lionel Levine*, University of California, Berkeley
James Propp, University of Wisconsin, Madison
(983-05-1145)
10:00 a.m. Random Surfaces: Large Deviations and Gibbs Measure Classifications. Scott R. Sheffield*, Microsoft Research
(983-60-865)
10:30 a.m. Stationary Determinantal Processes (Fermionic Lattice Gases). Russell D Lyons*, Indiana University and Georgia Tech
(983-82-867)
2:15 p.m. Spectral Analysis of Power Law Graphs. Milena Mihail*, Georgia Tech
(983-05-1206)
2:45 p.m. Epidemics, Erdos numbers, and the Internet: Graphs and networks in the real world. Mark Newman*, University of Michigan
(983-92-887)
3:45 p.m. Break
4:15 p.m. Robustness in some discrete dynamical models. Michel Morvan*, Ecole normale sup\'erieure de Lyon and Institut universitaire de France
(983-68-1074)
4:45 p.m. Computing with DNA and RNA. Laura F Landweber*, Princeton University
(983-92-1414)
5:15 p.m. Proofreading Tile Sets: Error Correction in Algorithmic Self-Assembly. Renat Bekbolatov, California Institute of Technology
Erik Winfree*, California Institute of Technology
(983-92-819)
8:30 a.m. Algorithms for Estimating Trends in a Stream of Network Packets Using Little Memory. Erik D. Demaine*, Massachusetts Instiute of Technology
Alejandro Lopez-Ortiz, University of Waterloo
J. Ian Munro, University of Waterloo
(983-68-850)
9:00 a.m. Communication complexity and regular languages. Denis Therien*, McGill
(983-68-650)
9:30 a.m. Muirhead-Rado Inequality for Hermitian Operators. Leonard J Schulman*, Caltech
(983-05-1411)
10:00 a.m. Break
10:30 a.m. Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows. Mary Cryan, University of Leeds
Martin Dyer, University of Leeds
Leslie Ann Goldberg, University of Warwick
Mark Jerrum, University of Edinburgh
Russell Martin*, University of Warwick
(983-68-1177)
11:00 a.m. Probabilistic Packet Marking for Distributed Denial of Service Attacks. Micah Adler*, University of Massachusetts, Amherst
(983-94-1425)
11:30 a.m. The Number of Bit Comparisons Used by Quicksort. James Allen Fill*, The Johns Hopkins University
Svante Janson, Uppsala University
(983-68-1002)
1:30 p.m. On the Random k-SAT Threshold. Dimitris Achlioptas*, Microsoft Research
Yuval Peres, UC, Berkeley
(983-05-1056)
2:00 p.m. Random MAX SAT, random MAX CUT, and their phase transitions. Don Coppersmith, IBM Research
David Gamarnik, IBM Research
Mohammad Hajiaghayi, MIT
Gregory B Sorkin*, IBM Research
(983-60-1454)
2:30 p.m. The Scaling Window for Percolation on the n-cube. Christian Borgs*, Microsoft Research
Jennifer Tour Chayes, Microsoft Research
Remco van der Hofstad, Eindhoven University of Technology
Gordon Slade, University of British Columbia
Joel Spencer, Courant Institute
(983-05-916)
3:00 p.m. A Phase Transition for Avoiding a Giant Component. Tom Bohman, Carnegie Mellon University
Jeong Han Kim*, Microsoft Research
(983-05-1443)
3:30 p.m. Balls into Bins: The Rich get Richer. Joel H Spencer*, Courant Institute
(983-05-929)