Lectures Fundamentals of Algorithms and Data Structures Discrete Probability Theory Efficient Algorithms and
Data Structures II Python for Fine Programmers Proseminar Skilled Programming for the ICPC Seminar Summer Academy in Sarntal Courses for PhD Students Oberseminar

Efficient Algorithms and Data Structures II

• Lecturer:
  Prof. Dr. Ernst W. Mayr
• Module:
  IN2004
• Area:
  4+2 lectures per week in area III (Theoretical Computer Science)
  advanced course, topic algorithms
• Time and Location:
  Tuesday, 08:30–10:00, MI HS 2
  Thursday, 08:30–10:00, 03.11.018
• Exam:
  Please see German Webpage for details.
• Exercises:
  2 hours per week exercises accompanying the lectures
  Teaching Assistant: Jeremias Weihmann
• Audience:
  graduate students of computer science
  students with computer science as minor
• ECTS: 8 points
• Prerequisites:
  1st and 2nd year courses
  Course Efficient Algorithms and Datastructures I advantagious, but not necessary.
• Recommended for:
  In-depth knowledge in topic Algorithms
• Related and Advanced Lectures:
  Internet algorithmics
  Randomized Algorithms
  Complexity Theory
  
• Contents
• Slides:
  

  April:	April 20, 2010	April 22, 2010
  	April 27, 2010	April 29, 2010
  May::	May 4, 2010	May 6, 2010
  	May 11, 2010
  	May 18, 2010	May 20, 2010
  		May 27, 2010
  June:	June 1, 2010
  	June 8, 2010	June 10, 2010
  	June 15, 2010	June 17, 2010
  	June 22, 2010	June 24, 2010
  	June 29, 2010
  July:		July 1, 2010
  	July 6, 2010	July 8, 2010
  	July 13, 2010	July 15, 2010
  	July 20, 2010	July 22, 2010

  
  And here you get everything in one file! 
  
• References:
  Contents of this course are essentially covered by the following books:
  1. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman.
     The design and analysis of computer algorithms.
     Addison-Wesley Publishing Company: Reading (MA), 1974
  2. Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin.
     Network flows --- Theory, algorithms, and applications.
     Prentice-Hall: Englewood Cliffs, NJ, 1993
  3. Thomas H. Cormen, Charles E. Leiserson, Ron L. Rivest, Clifford Stein.
     Introduction to Algorithms.
     2nd Edition, The MIT Press, Cambridge, MA, 2001
  4. Dan Gusfield
     Algorithms on Strings, Trees, and Sequences.
     Cambridge University Press, 1999, TUM-Bibliothek Signatur: BIO 110f 2001A 16544
  5. Volker Heun
     Grundlegende Algorithmen: Einführung in den Entwurf und die Analyse effizienter Algorithmen.
     2nd Edition, Vieweg: Braunschweig-Wiesbaden, 2003
  6. Donald E. Knuth
     The art of computer programming. Vol. 1: Fundamental algorithms.
     3rd Edition, Addison-Wesley Publishing Company: Reading (MA), 1997
  7. Christos H. Papadimitriou, Kenneth Steiglitz.
     Combinatorial optimization: Algorithms and complexity.
     Prentice-Hall, Englewood Cliffs, NJ, 1982
  8. Steven S. Skiena.
     The Algorithm Design Manual.
     Springer-Verlag, New York, 1998.
  9. Robert E. Tarjan.
     Data Structures and Network Algorithms.
     CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, PA, 1983