Past semesters
Spring 2009
- Luca Cardelli: Molecules as Automata
- Kousha Etessami: The computational complexity of Nash equilibria and Fixed Points of Algebraic Functions
- Dexter Kozen: Metric Coinduction
- Grzegorz Malewicz: Computing on Large Clusters (Part II)
- Michael Witbrock: Thinking on a Grand Scale
- Assaf Kfoury: Lightweight Formal Methods for the Development of High-Assurance Networking Systems
Autumn 2008/09
Spring 2008
Autumn 2007/08
- Sub-linear time algebraic algorithms
(Madhu Sudan, MIT, USA) - Locality sensitive distributed computing
(David Peleg, Weizmann Institute of Science, Israel) - Extracting programs from classical proofs
(Thierry Joly, Universite Paris VII Denis Diderot, France) - Normalization by evaluation
(Peter Dybjer, Chalmers University of Technology, Sweden) - Artur Czumaj: Probabilistic Methods in CS
(Artur Czumaj, University of Warwick, UK)
Spring 2007
- Shortest paths - exact and approximate algorithms
(Uri Zwick, Tel Aviv University, Israel) - Provable Anonymity
(Mirosław Kutylowski, Wroclaw University of Technology, Poland) - Database consistency: logic-based approaches
(Jan Chomicki, University at Buffalo, USA and Wenfei Fan, University of Edinburgh, UK)
Autumn 2006/07
- Wybrane zagadnienia algorytmiki / Selected issues in algorithm analysis
(W. Rytter, Warsaw University, Poland) - Gry i weryfikacja / Games and verification
(I. Walukiewicz, LaBRI, France) - Zagadnienia implementacji adaptowalnych systemow udostepniania uslug sieciowych / Adaptable Service Oriented Architectures
(K. Zieliński, AGH, Poland)