Program Schedule

Sheraton Vancouver Wall Center, Vancouver, British Columbia, Canada
January 22, 2005

All sessions will take place in Pavilion C unless otherwise noted.

8:00 AM Continental Breakfast (Junior Ballroom C&D)

9:00 AM Analytic Algorithmics, Combinatorics, and Information Theory
Invited Speaker: Wojciech Szpankowski, Purdue University

10:00 AM Coffee Break (Junior Ballroom C&D)

10:30 AM Performance Evaluation of Demodulation with Diversity---A Combinatorial Approach III (pdf)
Simon Bliudze and Daniel Krob, Ecole Polytechnique, France

11:00 AM Comparison of Two CDS Algorithms on Random Unit Ball Graphs (pdf)
Jennie Hansen, Herriot-Watt University, United Kingdom, and Eric Schmutz, Drexel University

11:30 AM Complexity of the Path multi-peg Tower of Hanoi (pdf)
Daniel Berend and Amir Sapir, Ben-Gurion University, Israel

12:00 PM Lunch (attendees on their own)

1:30 PM Mixing Points on an Interval (pdf)
Dana Randall, Georgia Institute of Technology, and Peter Winkler, Dartmouth University

2:00 PM Enumeration of Binary Trees, Lempel-Ziv’78 Parsings, and Universal Types (pdf)
Charles Knessl, University of Illinois, Chicago, and Wojciech Szpankowski, Purdue University

2:30 PM On the Average Density and Selectivity of Nodes in Multi-Digit Tries (pdf)
Yuriy Reznik, RealNetworks

3:00 PM Coffee Break (Junior Ballroom C&D)

3:30 PM Mixing Times for Random Walks on Geometric Random Graphs (pdf)
Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavret Shah, Stanford University

4:00 PM Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices (pdf)
Mordecai Golin, Yiu Leung, Yajun Wang, Xuerong Yong, Hong Kong and DIMACS

4:30 PM Counting Eulerian Circuits is #P-Complete (pdf)
Graham Brightwell, London School of Economics, and Peter Winkler, Dartmouth University

5:00 PM Approximately Counting Perfect Matchings in General Graphs (pdf)
Martin Furer and Shiva Kasiviswanathan, Pennsylvania State University

6:00 PM ACM-SIAM SODA Welcome Reception (Junior Ballroom C&D)