Autumn Semester 2020 takes place in a mixed form of online and classroom teaching.
Please read the published information on the individual courses carefully.

Peter Widmayer: Catalogue data in Autumn Semester 2018

Name Prof. Dr. Peter Widmayer
FieldInformatik
Address
Inst. f. Theoretische Informatik
ETH Zürich, CAB H 39.2
Universitätstrasse 6
8092 Zürich
SWITZERLAND
Award: The Golden Owl
E-mailwidmayer@inf.ethz.ch
DepartmentComputer Science
RelationshipProfessor Emeritus

NumberTitleECTSHoursLecturers
252-0209-00LAlgorithms, Probability, and Computing Information 8 credits4V + 2U + 1AE. Welzl, M. Ghaffari, A. Steger, D. Steurer, P. Widmayer
AbstractAdvanced design and analysis methods for algorithms and data structures: Random(ized) Search Trees, Point Location, Minimum Cut, Linear Programming, Randomized Algebraic Algorithms (matchings), Probabilistically Checkable Proofs (introduction).
ObjectiveStudying and understanding of fundamental advanced concepts in algorithms, data structures and complexity theory.
Lecture notesWill be handed out.
LiteratureIntroduction to Algorithms by T. H. Cormen, C. E. Leiserson, R. L. Rivest;
Randomized Algorithms by R. Motwani und P. Raghavan;
Computational Geometry - Algorithms and Applications by M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf.
252-0933-00LAlgorithms and Complexity (HS)1 credit1SJ. Hromkovic, P. Widmayer
AbstractThe seminar treats selected problems of current interest in the area of algorithms and complexity.
ObjectiveDevelop an understanding of selected problems of current interest in the area of algorithms and complexity.
ContentThis seminar treats selected problems of current interest in the area of algorithms and complexity.
Lecture notesNone
LiteratureResearch papers, to be chosen in the seminar.
Prerequisites / NoticePrerequisites: Basic understanding of algorithms and complexity.
252-4230-00LAdvanced Algorithms and Data Structures Information Restricted registration - show details
Number of participants limited to 24.

As a prerequisite, students must have more than just basic knowledge on algorithms and data structures.
If you have enjoyed the class "Algorithms, Probability and Computing", this seminar is just right for you!

The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.

Takes place for the last time!
2 credits2SP. Widmayer, S. Leucci, P. Uznanski
AbstractWe will look into modern approaches of algorithms and data structures. A few breakthrough and highly influential papers from the general area of algorithms, from the past 20 years will be selected for students to study.
ObjectiveDevelop an understanding of modern techniques and paradigms in the design of algorithms and data structures.
ContentTopics include (but are not exhausted by):

-graph algorithms,
-text algorithms,
-approximation algorithms,
-algebra in algorithms,
-streaming algorithms,
-conditional lower bounds,
-sparsification,
-randomness in algorithms,
-sampling.
Prerequisites / NoticeAlgorithms and Data Structures, or equivalent.
263-0006-00LAlgorithms Lab
Only for master students, otherwise a special permission by the student administration of D-INFK is required.
8 credits4P + 3AA. Steger, E. Welzl, P. Widmayer
AbstractStudents learn how to solve algorithmic problems given by a textual description (understanding problem setting, finding appropriate modeling, choosing suitable algorithms, and implementing them). Knowledge of basic algorithms and data structures is assumed; more advanced material and usage of standard libraries for combinatorial algorithms are introduced in tutorials.
ObjectiveThe objective of this course is to learn how to solve algorithmic problems given by a textual description. This includes appropriate problem modeling, choice of suitable (combinatorial) algorithms, and implementing them (using C/C++, STL, CGAL, and BGL).
LiteratureT. Cormen, C. Leiserson, R. Rivest: Introduction to Algorithms, MIT Press, 1990.
J. Hromkovic, Teubner: Theoretische Informatik, Springer, 2004 (English: Theoretical Computer Science, Springer 2003).
J. Kleinberg, É. Tardos: Algorithm Design, Addison Wesley, 2006.
H. R. Lewis, C. H. Papadimitriou: Elements of the Theory of Computation, Prentice Hall, 1998.
T. Ottmann, P. Widmayer: Algorithmen und Datenstrukturen, Spektrum, 2012.
R. Sedgewick: Algorithms in C++: Graph Algorithms, Addison-Wesley, 2001.