Lectures Discrete Structures Efficient Algorithms and
Data Structures I Advanced Network and
Graph Algorithms Proseminar Data compression Seminar Algorithms for NP-hard Problems Lab Course Design of Algorithms Courses for PhD Students Oberseminar

Efficient Algorithms and Data Structures I

• Lecturer:
  Prof. Dr. Ernst W. Mayr
• Module: IN2003
• Area:
  4+2 lectures per week in area III (Theoretical Computer Science)
  core course, topic algorithms
• Time and Place:
  Tuesday, 08:30–10:00, MI 00.13.009A
  Thursday, 08:30–10:00, MI HS2
• Exercises (web page [in German]):
  2 hours per week exercises accompanying the lectures
  Tuesday, 14:15–15:45, MI 00.08.038
  Teaching Assistant: Tobias Lieber
  
• Course Certificate:
  To successfully complete the module students must obtain at least 40% of the points on the (two-part) written exam and also at least 40% of the points for the homework.
• Exams:
  Please see German webpage for details.
• Audience:
  graduate students of computer science
  students with computer science as minor
• Prerequisites:
  1st and 2nd year courses
• Recommended for:
  Fundamental knowledge in topic Algorithms
• Contents
• Related and Advanced Lectures:
  Efficient Algorithms and Data Structures II
  Internet Algorithmics
• Slides:
  

  October:	October 19, 2010	October 21, 2010
  	October 26, 2010	October 28, 2010
  November:	November 2, 2010	November 4, 2010
  	November 9, 2010	November 11, 2010
  	November 16, 2010	November 18, 2010
  	November 23, 2010	November 25, 2010
  	November 30, 2010
  December:	December 7, 2010	December 9, 2010
  	December 14, 2010	December 16, 2010
  	December 21, 2010	December 23, 2010
  January:	January 11, 2011	January 13, 2011
  	January 18, 2011	January 20, 2011
  	January 25, 2011	January 27, 2011
  February:	February 1, 2011	February 3, 2011
  	February 8, 2011	February 10, 2011

  
  And here you get everything in one file! 
  (Some hints for using the above slides)
  

If you want to freshen up on the course Discrete Structures here are the slides for it (from WS2005/06); for better navigation use the bookmarks. -->
• References:
  
  • Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman.
    The design and analysis of computer algorithms.
    Addison-Wesley Publishing Company: Reading (MA), 1974
  • Thomas H. Cormen, Charles E. Leiserson, Ron L. Rivest, Clifford Stein.
    Introduction to Algorithms.
    2nd edition, The MIT Press, Cambridge, MA, 2001.
  • Donald E. Knuth.
    The Art of Computer Programming: Fundamental Algorithms.
    3rd edition, Addison-Wesley, Reading, MA, 1997.
  • Donald E. Knuth.
    The Art of Computer Programming: Sorting and Searching.
    2nd edition, Addison-Wesley, Reading, MA, 1997.
  • Volker Heun.
    Grundlegende Algorithmen: Einführung in den Entwurf und die Analyse effizienter Algorithmen.
    2nd edition, Vieweg, Braunschweig-Wiesbaden, 2003.
  • Uwe Schöning.
    Algorithmik.
    Spektrum Akademischer Verlag, Heidelberg, 2001.
  • Michael T. Goodrich, Roberto Tamassia.
    Algorithm Design: Foundations, Analysis, and Internet Examples.
    John Wiley & Sons, Inc., 2002.
  • Christos H. Papadimitriou, Kenneth Steiglitz.
    Combinatorial Optimization: Algorithms and Complexity.
    Prentice Hall, 1982.
  • Steven S. Skiena.
    The Algorithm Design Manual.
    Springer, 1998.
• Office Hours:
  look here