This course is suitable for students in the Diploma programs who have already attended some discrete mathematics courses. It is also part of the Master's Program in Mathematics. Basic knowledge in combinatorial optimization is required.
This course will discuss theory and practice of chip design. Many applications of combinatorial optimization will be shown. Recent theory, algorithms, and implications of new chip technology will be discussed. The course will cover topics in routing, placement, timing analysis and optimization. The detailed syllabus will also depend on the attendees' interests. The course will be more interactive than usual lecture courses.
This course is in English. Unfortunately there is no suitable textbook yet. I will distribute some lecture notes. Here are two references that can serve as starting points for literature search:
|Class Hours:||Tuesdays and Thursdays 12-2 pm (12:15-13:45)|
|Room:||Gerhard-Konow-Hörsaal (in the Arithmeum building, Lennéstr. 2)|
|First Class:||April 8, 2008|
|Exercise Classes:||S. Held, Thursdays 10-12. Web page for Exercises|
Prof. Dr. J. Vygen