Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Mini-Course on Competitive Online Algorithms
 

Summary: BRICS
Mini-Course on
Competitive Online Algorithms
Susanne Albers
MPI, Saarbrucken
Aarhus University
August 27 {29, 1996
I would like to thank BRICS and, in particular, Erik Meineche Schmidt for giving me the
opportunity to teach this mini-course at Aarhus University. Lecturing the course was a great
pleasure for me. In winter 1995/96, Dany Breslauer rst pointed out to me the possibility to
teach a mini-course in Arhus, and I thank him for his encouragement. Furthermore, I would
like to thank all members of the Computer Science Department at Aarhus University for their
very kind hospitality throughout my stay.
Overview
The mini-course on competitive online algorithms consisted of three lectures. In the rst lecture
we gave basic de nitions and presented important techniques that are used in the study on online
algorithms. The paging problem was always the running example to explain and illustrate the
material. We also discussed the k-server problem, which is a very well-studied generalization of
the paging problem.
The second lecture was concerned with self-organizing data structures, in particular self-orga-

  

Source: Albers, Susanne - Institut für Informatik, Humboldt-Universität zu Berlin

 

Collections: Computer Technologies and Information Sciences