Past semesters
Fall 2023/24
- Loris Marchal, ENS Lyon. Topic: Data aware algorithms
- Paweł Gawrychowski, University of Wrocław. Topic: String algorithms in the Word RAM model
Spring 2023/24
- Filip Murlak, University of Warsaw. Topic: Graph Queries and Description Logics
- Gregory Kucherov, Gustave Eiffel University. Topic: Hashing-based data structures
- Pasquale Minervini, University of Edinburgh. Topic: Language Models and Neuro-Symbolic Learning
Fall 2022/23
- Michael Blondin, Algorithmic verification of infinite-state systems via relaxations
- Artur Czumaj, Modern Parallel Algorithms
Spring 2022/23
- Vincent Cohen-Addad, Provable algorithms for data mining and unsupervised machine learning
- Rupak Majumdar, Random Testing for Distributed Systems
- Rahul Savani, The Computational Complexity of Game-Theoretic Solutions
Fall 2021/22
Spring 2021/22
- Meghyn Bienvenu, Ontology-Mediated Query Answering
- Tomasz Trzciński, Deep generative view on continual learning
- Tomasz Rembiasz and Juliusz Straszyński, Attention models
- Konrad Iwanicki, Eventual Consistency in Distributed Systems
- Theodore A. Slaman, Computability Theory, Set Theory and Geometric Measure Theory
Fall 2020/21
- Aleksander MÄ…dry, Robust Machine Learning
- Wojciech Czerwiński, Vector Addition Systems
- Leszek Kołodziejczyk, Topics in propositional proof complexity
Spring 2020/21
- Krzysztof Nowicki, Massively Parallel Computation
- Michał Pilipczuk and Szymon Toruńczyk, Structurally tractable graph classes
Spring 2019/20
Fall 2019/20
- Anuj Dawar: Symmetric Computation
- Christian Wulff-Nilsen: Dynamic Graph Algorithms
- Nikhil Srivastawa: Geometry of Polynomials
Spring 2018/19
Fall 2018/19
Spring 2017/18
- Marcin Jurdziński: Algorithms for solving parity games
- Carsten Lutz: Ontology Engineering and Ontological Data Access
- Daniel Kráľ: Combinatorial limits
- Atri Rudra: (Dense Structured) Matrix Vector Multiplication
- Łukasz Kaiser: Deep Learning — The Good, the Bad, and the Ugly
Fall 2017/18
- Piotr Faliszewski: Algorithmic Analysis of Elections
- Jakob Rehof: A Type-Based Approach to Component-Oriented Synthesis
- Albert Atserias: The Width Method for Resolution and Sums-of-Squares Proofs
Spring 2016/2017
Fall 2016/2017
- Bartek Wilczyński: Crash course on Computational Biology for Computer Scientists
- Marc Bezem: The Univalence Axiom in Dependent Type Theory
- Paweł Sobociński: Graphical Linear Algebra
Spring 2015/2016
- Stefan Dziembowski: Introduction to cryptocurrencies
- Giuseppe F. Italiano: Dynamic graph algorithms
- Stanisław Matwin: Applications of machine learning to Big Data
Fall 2015/2016
- Justyna Petke: Search-Based Software Engineering, Combinatorial Interaction Testing and Genetic Improvement
- Alexandra Silva: Extensions of Kleene Algebra and applications to programming semantics and networks
- James Worrell: Machine Learning Theory
Spring 2014/2015
- Dan Suciu: Multi-join Query Evaluation on Big Data
- Aleksander Mądry: Graphs, Linear Algebra, and Continuous Optimization
- Krzysztof Onak: Sublinear-Time Algorithms
- Ugo Dal Lago: From Implicit Complexity to Quantitative Resource Analysis
Fall 2014/2015
- Jerzy Czyżowicz: Selected Topics in Algorithmics of Mobile Robots
- Krzysztof Krawiec: Heuristic Approaches to Program Synthesis, Genetic Programming and Beyond
Spring 2013/2014
- Paweł Gawrychowski: String Indexing in the Word RAM mode
- Brian Barsky: Introduction to Computer Graphics and Geometric Modeling
Fall 2013/2014
- Jeffrey Ullman: Algorithms for MapReduce
- Wiktor Marek: Practical applications of algorithms related to NP-complete problems
- Marcin Kozik: The algebraic approach to CSP
Spring 2012/2013
- Alessandro Panconesi: The algorithmics of information diffusion in social networks
- Martin Escardo: An introduction to topological ideas in computation
- Marta Kwiatkowska: Probabilistic model checking
Fall 2012/2013
- Venkatesan Guruswami: Algorithmic coding theory: Some recent advances
- Grzegorz Rozenberg: A formal framework for processes inspired by the functioning of living cells: Natural Computing approach
- Nicolas T. Courtois: Multiplicative complexity and circuit optimization problems with applications in cryptography
Spring 2011/2012
- Anwitaman Datta: Peer-to-Peer Structured Overlays and Storage Systems
- Frederique Oggier: Coding Technique for Distributed Storage Systems
- Phokion G. Kolaitis: Schema Mappings and Data Exchange
- William F. Smyth: Are Three Squares Possible?
- Talal Rahwan: Cooperative Game Theory & its Applications to Multi-Agent Systems
Fall 2011/2012
Spring 2010/2011
- Marcin Bienkowski: A Toolbox for Online Algorithms
- Jean-Eric Pin: Algebraic theory of automata: historical perspective and new advances
Fall 2010/2011
Spring 2009/2010
- Krzysztof R. Apt: Strategic Games. A Minicourse for Computer Scientists
- Peter Boncz: Column-Store Technologies
- Marek J. Druzdzel: Probabilistic Graphical Models
- Javier Esparza: Analysis of Systems with Infinite State Spaces
- Lukasz Kowalik: Exact Algorithms for NP-hard Problems
Fall 2009/2010
Spring 2008/09
- Luca Cardelli: Molecules as Automata
- Kousha Etessami: The computational complexity of Nash equilibria and Fixed Points of Algebraic Functions
- Assaf Kfoury: Lightweight Formal Methods for the Development of High-Assurance Networking Systems
- Dexter Kozen: Metric Coinduction
- Grzegorz Malewicz: Computing on LargeMClusters
- Michael Witbrock: Thinking on a Grand Scale
Fall 2008/09
-
Computing on Large Clusters
(Grzegorz Czajkowski and Grzegorz Malewicz, Google, USA) -
Cryptography on non-trusted machines
(Stefan Dziembowski, University of Rome "La Sapienza", Italy) -
Three Grand Challenges
(David Harel, Weizmann Institute, Israel) -
Approximation algorithms for stochastic optimization problems
(Piotr Sankowski, University of Warsaw, Poland)
Spring 2007/08
Fall 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)
Fall 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)