8:00 a.m. On a Conjecture Relating Pebbling Numbers and Pebbling Thresholds. Andrzej Czygrinow, Arizona State University (on leave at Adam Mickiewicz University, Poland)
Michelle Wagner*, Department of Defense
(973-05-1285)
8:30 a.m. Quasirandom Permutations: Theory and Practice. Joshua N. Cooper*, University of California, San Diego
(973-05-1332)
9:00 a.m. Embedding graphs of bounded degree in sparse pseudorandom graphs. Yoshiharu Kohayakawa*, Universidade de S\~ao Paulo
(973-05-1304)
9:30 a.m. Generating random colourings of a graph with high girth and maximum degree. Michael Molloy*, University of Toronto
(973-05-1265)
10:00 a.m. Crossing Numbers for Random Graphs. Joel H Spencer*, Courant Institute
(973-05-14)
10:30 a.m. Soem recent results and questions concerning random regular graphs with high degree. Van H Vu*, UCSD
(973-05-1159)
8:00 a.m. Optimal paths related to transport problems. Qinglan Xia*, Rice University
(973-49-1439)
8:30 a.m. Guessing secrets wtih inner product questions. Fan Chung, UCSD
Ronald Graham, UCSD
Linyuan Lu*, UCSD
(973-05-1351)
9:00 a.m. Simulated Tempering: Fast or Slow? Claire Kenyon, Universite de Paris Sud
Dana Randall*, Georgia Tech
(973-60-1397)
9:30 a.m. Approximating the domatic number. Uri Feige, Weizmann Institute, Israel
Magnus M Halldorsson, Science Inst., University of Iceland
Guy Kortsarz, Open University, Israel
Aravind Srinivasan*, University of Maryland
(973-05-846)
10:00 a.m. Discussion.
10:30 a.m. On Playing Golf With Two Balls. Ioana Dumitriu, MIT
Prasad Tetali, Georgia Institute of Technology
Peter Winkler*, Bell Labs
(973-60-154)
1:00 p.m. Random graphs and Internet graphs. Fan Chung*, University of California, San Diego
(973-05-1345)
1:30 p.m. A Phase Transition in the Optimum Partitioning Problem. Christian H Borgs*, Microsoft Research
Jennifer T Chayes, Microsoft Research
Boris Pittel, Ohio State University
(973-05-1203)
2:00 p.m. Tradeoffs in Probabilistic Packet Marking for IP Traceback. Micah Adler*, University of Massachusetts, Amherst
(973-94-746)
2:30 p.m. Probabilistic Techniques in Data Stream Computations. S. Muthu Muthukrishnan*, AT&T Research
(973-68-1308)
3:00 p.m. The Phase Transition for Percolation on the n-Cube. Christian H Borgs, Microsoft Research
Jennifer T Chayes*, Microsoft Research
Remco van der Hoftstad, Delft University of Technology
Gordon Slade, University of British Columbia
Joel Spencer, New York University
(973-05-1201)
3:30 p.m. Learning mixtures of arbitrary gaussians. Sanjeev Arora*, Princeton University
Ravi Kannan, Yale University
(973-68-861)
4:00 p.m. Failure Detection in Networks. Jon M Kleinberg*, Cornell University
(973-05-220)
4:30 p.m. Random walks on the World Wide Web. Monika R Henzinger*, Google Inc.
(973-68-353)
5:00 p.m. Some combinatorial problems associated with the Internet. Ronald L. Graham*, University of California, San Diego
(973-05-1334)