This course is part of the Master's Programs in Mathematics and Computer Science. It is also suitable for students in the Diploma programs who have already attended some discrete mathematics courses. Basic knowledge in combinatorial optimization is required.
We 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 covers topics in placement, timing optimization, and routing.
This course is in English. Since there exists no suitable textbook yet, I will distribute lecture notes. Many topics and references can also be found in:
|Class Hours:||Tuesdays and Thursdays, 12:15-13:45|
|Room:||Gerhard-Konow-Hörsaal (in the Arithmeum building, Lennéstr. 2)|
|Exercise Classes:||Wednesdays 14:15-15:45, Seminarraum|
|Oral exams:||July 16-17 and September 27, by appointment|
Prof. Dr. J. Vygen