Lade Daten...

Lecture Notes

Every students needs to scribe at least one lecture in order qualify for the oral exam. Sebastian has prepared a template LaTeX file for this. This template is inspired by the one used by Nikhil Bansal in his course on Algorithms and Uncertainty.


#### Books * Allan Borodin and Ran El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press, 0-521-56392-5, 2008.

  • Niv Buchbinder and Joseph Naor, The Design of Competitive Online Algorithms via a Primal-Dual Approach. Foundations and Trends in Theoretical Computer Science Vol. 3, Nos. 2-3, 93-263, DOI: 10.1561/0400000024, 2007.

  • Susanne Albers, Lecture notes on competitive online algorithms. BRICS Lecture Series LS-96-2, Århus University, Denmark, 1996.

  • Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms. Cambridge University Press, 0-521-47465-5, 1995.

  • Amos Fiat and Gerhard Woeginger, Online Algorithms: The State of the Art. Springer, 978-3-540-68311-7, 1998.

Lecture Notes