Lecture Notes

• Foundations of Theoretical Computer Science ("Einführung in die Informatik")
  Marek Karpinski (ausgearbeitet von Mathias Hauptmann, Kai Werther und Thorsten Werther)
• Efficient Algorithms and Computational Complexity ("Effiziente Algorithmen und Komplexitätstheorie (Algebraische Interpolations- und Zählalgorithmen)")
  Marek Karpinski (ausgearbeitet von Kai Werther)
• Randomized Approximation Algorithms for Hard Computational Problems ("Randomisierte und approximative Algorithmen für harte Berechnungsprobleme")
  Marek Karpinski (ausgearbeitet von Carsten Dorgerloh, Christoph Günzel, Mathias Hauptmann, Peter Wegner und Jürgen Wirtgen)
• Marek Karpinski's Lecture at the "Spring School on Approximation and Online Algorithms", University of Paris-Sud, May 18, 2001.
• Marek Karpinski's Lectures at the "NHC Spring School", Tokyo, February 27 - March 1, 2006.
• Marek Karpinski's Lecture on "Constant Time Approximation Schemes: New Paradigms and Recent Developments", LRI, University of Paris-Sud, June 23rd, 2006.
• Marek Karpinski's Lecture at the 21st European Conference on Operational Research, EURO XXI (2006), Reykjavik, July 5, 2006.
• Marek Karpinski's Invited Lecture on "Metric Construction for Path Coupling, Rapid Mixing, and Approximate Counting", Minisymposium on Stochastic Algorithms and Markov Processes, DMV-Tagung, September 19, 2006.
• Marek Karpinski's Lecture on "Sampling in Large Matrices and Approximation of MAX-CSP", Workshop on "Random Matrices: Probabilistic Aspects and Applications", Hausdorff Research Institute, Bonn, January 18, 2008.

---

• RA-Lecture