DIMACS CHALLENGE 5 WORKSHOP SCHEDULE

  40 minute talks (plus two 30-minute survey talks) on Monday, Tuesday.
  25 minute talks on Wednesday. 

Monday, October 28th: Dictionaries
------------------------------------
 8:30  	Coffee and bagels. 
 9:10 	Greetings from DIMACS 
 9:15   History of the DIMACS Challenge (DSJ)
 9:45   Remarks about the Fifth Challenge (CCM)
10:15   Tutorial on dictionary implementation techniques.  
10:45   BREAK 
11:15   Katajainen and Lykke, ``Experiments with universal hashing.''

12:00   LUNCH at DIMACS 
1:00    Deitzfelbinger and Huhne, ``A dictionary implementation based
                  on dynamic perfect hashing.'' 
1:45    Silverstein, ``A practical perfect hashing algorithm.'' 
2:30    Andersson, which flavor of balanced tree? 
3:15    BREAK 
3:45    Battiti ``Time and Space-efficient data structures for 
                 history-based heuristics: a C++ implementation.
4:30    Korupolu et al.  ``Experimental evaluation of incremental 
                 algorithms for graph connectivity and biconnectivity.'' 
5:15    BREAK
5:30    RECEPTION for workshop participants at DIMACS.  

Tuesday, October 29th: Priority Queues
--------------------------------------
 8:30  Coffee and bagels. 
 9:10  Announcements and Remarks.  
 9:15  Tutorial on priority queue implementation techniques. 
 9:45  Matias et al. ``Implementation and performance evaluation of
               approximate priority queues.''
10:30  BREAK
11:00  Andersson and Thorup, ``Implementing monotone priority queues.''
11:45  Goldberg and Silverstein, ``Practical evaluation of HOT queues.''
12:30  LUNCH  
 2:00  Panel Discussion on results of the Fifth DIMACS Challenge.  
 3:30  BREAK
 4:00  Panel Discussion on the future of the DIMACS Challenge. 
 5:00  DONE 

Wednesday, October 30th: Methods and standards
-----------------------
 8:30   Continental breakfast. 
 9:00   The Agenda. (Johnson, McGeoch) 
 9:10   Talk: David Johnson(AT&T Labs)
 		Do's and Don'ts in the Experimental Analysis of 
       		Algorithms
 9:30   Talk: Bernard Moret(University of New Mexico)
 		Toward a discipline of experimental algorithmics
 9:50   Talk: Richard Anderson (University of Washington)
10:10   Talk: Irv Lustig (CPLEX)
 		Report from the War Zone: Reflections Past Experiments
10:40   BREAK
11:10   Talk: Jon Bentley (Bell Labs)
11:30   Talk: Roberto Battiti (Univeristy of Trento)
 		Machine Learning Methods for Parameter Tuning in Heuristcs
11:50   Talk: Nate Dean (Bell Labs)
 		The Link project
12:10   LUNCH
 1:10   Talk: Cathy McGeoch (Amherst College)
 1:30   Talk: Jim Orlin (MIT)
 1:50   Talk: Panos Pardalos (Univeristy of Florida)
		Test Problem Generation and Test Problem Collections
 2:10   Talk: Andrew Goldberg (NEC)
		What to Solve: Problems for Algorithm Evaluation
 2:30   BREAK
 3:00   Panel discussion on standards and methods in experimental 
             analysis of algorithms.