We are indebted to the following sponsors for vital financial support:
Friday, May 9, 2008(talks in the CS Dept., Large Auditorium (104))
8:00 - 9:00 Continental breakfast, CS Dept.,
Banana Gallery (outside 105 auditorium)
9:00 - 9:15 Welcome
9:15 - 9:45 Life in the Fast Lane: Ackermann and Its Cousins
Bernard Chazelle, Princeton University
9:45 - 10:30 Union-Find with Constant Time Deletions
Mikkel Thorup, AT&T Labs
10:30 - 11:00 Coffee break
11:00 - 11:45 The Binary Blocking Flow Algorithm for the Maximum Flow Problem
Andrew Goldberg, Microsoft Research
11:45 - 12:30 Challenges in Web Information Retrieval
Monika Henzinger, EPFL and Google
12:30 - 2:00 Lunch (Convocation Room, Friend Center)
2:00 - 2:45 The Analysis of Self-Adjusting Data Structures:
Results, Conjectures, and Alternatives
John Iacono, Polytechnic University
2:45 - 3:30 Non-linearity in Davenport-Schinzel Sequences
Seth Pettie, University of Michigan
3:30 - 4:00 Coffee break
4:00 - 4:45 Fast Converging Tatonnement Algorithms for
One Time and Ongoing Markets
Richard Cole, New York University
4:45 - 5:30 Competitive Auctions
Anna Karlin, University of Washington
5:30 - 7:30 Social "hour", CS Dept., Tea Room
7:30 Dinner, Nassau Inn
Saturday, May 10, 2008 (talks in the CS Dept., Large Auditorium (104))
8:30 - 9:00 Coffee, CS Dept., Banana Gallery (outside 105 auditorium)
9:00 - 9:45 How to Cut a Birthday Cake and other Planar Separating Tales
Dick Lipton, Georgia Tech
9:45 - 10:30 Algorithms for Some Network Optimization Problems in Planar Graphs
Phil Klein, Brown University
10:30 - 11:00 Break
11:00 - 11:45 Stabbing a Dynamic Set of Intervals
Haim Kaplan, Tel Aviv University
11:45 - 12:15 Fun with Path Compression
Raimund Seidel, Universitat des Saarlandes
12:15 Workshop Ends
Previous: Participation
Workshop Index
DIMACS Homepage