On-Line Algorithms


Announcement:

We didn't get to the WFA for the k-server problem, so we will not cover the last two problems on the weekly note for lecture 12 on May 9. We will instead do the ones from the last note we didn't get to, and save these for May 23.

Description

A course description.

The textbook:

Online Computation and Competitive Analysis, by Borodin and El-Yaniv. There will also be notes.
There is a homepage for the textbook, including errata list.
Further errata found by students who took this course earlier.
Further errata found by students who took this course in 2004.

Exam

  1. The exam questions for 2003 were here (and also in PDF).
  2. The exam questions for 2004 are here (and also in PDF).
  3. The exam questions for 2005 are the same as for 2004.

Weekly notes

    Lectures 1 and 2.ps also in PDF.
    Lecture 3.ps also in PDF.
    Lecture 4.ps also in PDF.
    Lecture 5.ps also in PDF.
    Lecture 6.ps also in PDF.
    Lecture 7.ps also in PDF.
    Lecture 8.ps also in PDF.
    Lecture 9.ps also in PDF.
    Lecture 10.ps also in PDF.
    Lecture 11.ps also in PDF.
    Lecture 12.ps also in PDF.
    Lecture 13.ps also in PDF.
    Lecture 14.ps also in PDF.
    Lecture 15.ps also in PDF.

Miscellaneous

  1. Susanne Albers' lecture notes in BRICS lecture series, number LS-96-2.
  2. Michel Goemans has course notes on on-line algorithms on his home page.

   
IMADA HOME | SDU HOME | Previous page |
Last modified: Tue Mar 6 09:12:12 CET 2007 - Joan Boyar <joan@imada.sdu.dk>