lyle@DICKENS.RUTGERS.EDU (01/04/91)
DIMACS is sponsoring a workshop on on-line algorithms, to be held at Rutgers University during February 11-13, 1991. Topics to be discussed at the workshop include: --- on-line algorithms for combinatorial optimization --- maintenance of dynamic data structures --- on-line algorithms for server and other traversal problems For further information, contact Lyle McGeoch (lyle@dimacs.rutgers.edu) or Daniel Sleator (sleator@cs.cmu.edu). The schedule will be distributed in mid-January.
lyle@DICKENS.RUTGERS.EDU (Lyle McGeoch) (01/17/91)
DIMACS WORKSHOP ON ON-LINE ALGORITHMS Rutgers University, February 1991 ------------------------------------------------------------------------- Monday, February 11, 1991 ------------------------- 9:00 - 9:30 Coffee, juice, pastries, etc. 9:30 - 9:35 Annoucements 9:35 -10:35 Richard Karp, "A graph-theoretic game with application to the k-server problem" 10:55 -11:55 Marek Chrobak and Lawrence Larmore, title to be announced 11:55 - 1:30 Lunch 1:30 - 2:15 Eddie Grove, "The Harmonic k-server algorithm is competitive" 2:15 - 3:00 Neal Young, "Linear programming duality yields a competitive analysis" 3:00 - 5:15 unscheduled Tuesday, February 12, 1991 -------------------------- 9:00 - 9:30 Coffee, juice, pastries, etc. 9:30 -10:25 David Johnson, "On-line algorithms for bin packing and scheduling: 1966 to the present" 10:45 -11:40 Hal Kierstead and Tom Trotter, "On-line graph coloring" 11:45 -12:15 Kirk Pruhs, "Online weighted matching" 12:15 - 3:00 Lunch and unscheduled time 3:00 - 3:30 Joan Lucas, "On the competitiveness of splay trees---relations to the union-find problem" 4:00 - 4:30 Ding-Zhu Du, "Competitive group testing" 4:30 - 5:00 Jeffrey Westbrook, "Randomized algorithms for the migration problem" 5:30 - 7:30 Reception Wednesday, February 13, 1991 ---------------------------- 9:00 - 9:30 Coffee, juice, pastries, etc. 9:30 -10:00 Baruch Schieber, "Navigating in unfamiliar geometric terrain" 10:20 -10:50 Bala Kalyan, "Visual searching and mapping" 10:50 -11:20 Joel Wein, "On-line scheduling of parallel machines" 11:20 -12:15 unscheduled 12:15 - 2:00 Lunch 2:00 - 2:30 Sandy Irani, "Competitive paging with locality of reference" 2:30 - 3:00 Prabhakar Raghavan, "A statistical adversary for on-line algorithms" 3:30 - 5:15 unscheduled ------------------------------------------------------------------------- The unscheduled time is intended for informal meetings between participants. Additional talks, problem sessions and other discussions may also be organized. All sessions will be held at the DIMACS building on the Busch campus of Rutgers University. Abstracts for the talks will be available by late January. Please write to Lyle McGeoch (lyle@dimacs.rutgers.edu) or Daniel Sleator (sleator@cs.cmu.edu) if you would like to receive abstracts. Also write for directions and other local information. Please let us know if you plan to attend.