Invited Talks & Keynote Talks
- 9 June 2026 ·
Distributed quantum advantage ·
33rd International Colloquium On Structural Information and Communication Complexity (SIROCCO 2026), Durham, UK
- 13 February 2026 ·
Distributed quantum advantage ·
51st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2026), Kraków, Poland
- 27 June 2024 ·
Fun stuff & latest news: Locality in all kinds of weird settings ·
Workshop on Measurable Combinatorics, Budapest, Hungary
- 13 October 2023 ·
Low-degree graphs, sparse matrices, and low-bandwidth networks ·
Workshop on Algorithms for Massive Graphs (AMG 2023), L’Aquila, Italy
- 9 June 2023 ·
What really happened in Helsinki and can you mend it? ·
International Colloquium on Structural Information and Communication Complexity (SIROCCO 2023), Alcalá de Henares, Spain
- 15 December 2020 ·
Can we automate our own work — or show that it is hard? (video) ·
Conference on Principles of Distributed Systems (OPODIS 2020), online event
- 23 June 2020 ·
Landscape of locality (video) ·
Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), online event
- 22 July 2019 ·
Locality lower bounds through round elimination ·
Workshop on Local Algorithms (WOLA 2019), Zurich, Switzerland
- 6 July 2018 ·
Logical characterizations in distributed computing ·
Horizons of Logic, Computation and Definability: Symposium in Honour of Lauri Hella's 60th birthday, Tampere, Finland
- 26 November 2017 ·
Understanding computation with computation (video) ·
Joint Estonian–Latvian Theory Days, Tartu, Estonia
- 15 October 2016 ·
Designing local algorithms with algorithms ·
Workshop on Local Algorithms (WOLA 2016), Cambridge, Massachusetts
- 12 October 2014 ·
Lower bounds for local algorithms ·
Workshop on Advances in Distributed Graph Algorithms (ADGA 2014), Austin, Texas
- 15 July 2014 ·
Modelling radio communication from the perspective of mobile apps: addressing real-world challenges, building on existing infrastructure ·
Workshop on Realistic models for Algorithms in Wireless Networks (WRAWN 2014), Paris, France
- 27 October 2013 ·
New lower bounds for distributed graph algorithms ·
Estonian CS Theory Days, Saka manor, Estonia
- 7 July 2013 ·
Locality in networks ·
Workshop on Foundations of Network Science, Riga, Latvia
- 26–27 April 2011 ·
Local algorithms: past, present, future ·
MITACS Workshop on Wireless Networks and Mobile Computing, Ottawa, Canada
Guest Lectures
- 7 February 2024 ·
Algorithms that design algorithms? ·
Algorithms for Distributed Systems course, TU Berlin
- 24 February 2021 ·
Can we automate our own work — or show that it is hard? (video) ·
LINCS seminar, online event
- 1 July 2020 ·
Lower bounds for maximal matchings and maximal independent sets (video) ·
Online algorithms seminar, University of Wrocław
- 3 February 2020 ·
Locality lower bounds through round elimination ·
IST Austria
- 22 January 2020 ·
Foundations of distributed computing in the 2020s ·
Computer Science Department, Technion
- 14 January 2020 ·
Foundations of distributed computing in the 2020s ·
Communication Technologies Group, University of Vienna
- 14 March 2019 ·
The landscape of distributed time complexity ·
Max-Planck Institute for Informatics
- 14 February 2019 ·
Lower bounds for maximal matchings and maximal independent sets ·
Max-Planck Institute for Informatics
- 5 February 2019 ·
Using computers to design distributed algorithms ·
Course on theory of distributed systems,
Max-Planck Institute for Informatics
- 21 February 2017 ·
Local algorithms on grids ·
Distributed Computing Group, ETH Zurich
- 16 February 2017 ·
Understanding computation with computation ·
Institute of Theoretical Computer Science, ETH Zurich
- 16 October 2015 ·
Local coordination and symmetry breaking ·
Chalmers
- 26 August 2015 ·
Local coordination and symmetry breaking ·
Distributed Computing Group, ETH Zurich
- 11 March 2015 ·
Median filtering is equivalent to sorting ·
Max-Planck Institute for Informatics
- 6 August 2014 ·
Median filtering is equivalent to sorting ·
TU Berlin
- 27 November 2011 ·
Distributed maximal matching: greedy is optimal ·
Faculty of Mathematics and Computer Science, Weizmann Institute of Science
- 23 November 2011 ·
Local algorithms: past, present, future ·
School of Engineering and Computer Science, Hebrew University of Jerusalem
- 29 November 2010 ·
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks ·
Institute of Operating Systems and Computer Networks, TU Braunschweig
- 2 November 2010 ·
Distributed algorithms for edge dominating sets ·
Institute of Operating Systems and Computer Networks, TU Braunschweig
- 26 October 2010 ·
Deterministic distributed algorithms: using covering graphs for good and evil ·
Institute of Operating Systems and Computer Networks, TU Braunschweig
- 19 April 2010 ·
Stable matchings from the perspective of distributed algorithms ·
School of Computer Science, Carleton University
- 11 March 2010 ·
Ramsey’s theorem and lower-bound results ·
Distributed Computing Group, ETH Zurich
- 10 March 2010 ·
An application of the Cole–Vishkin algorithm: approximating vertex covers in anonymous networks ·
Course on principles of distributed computing, ETH Zurich
- 8 March 2010 ·
Stable matchings from the perspective of distributed algorithms ·
Distributed Computing Group, ETH Zurich
- 2 March 2010 ·
Approximating vertex covers in anonymous networks ·
Distributed Computing Group, ETH Zurich
- 22 October 2009 ·
Stable matchings from the perspective of distributed algorithms ·
Heinz Nixdorf Institute, University of Paderborn
- 20 October 2009 ·
Local approximation algorithms for vertex cover ·
Heinz Nixdorf Institute, University of Paderborn
- 11 September 2008 ·
Local algorithms and max-min linear programs ·
TU Braunschweig
Other Selected Presentations
- 21 October 2025 ·
Round elimination ·
Distributed Quantum Computing Workshop 2025
- 21 October 2025 ·
A friendly introduction to distributed algorithms & locality ·
Distributed Quantum Computing Workshop 2025
- 29 November 2024 ·
Distributed quantum advantage ·
HIIT Foundations Friday
- 20 November 2024 ·
Locality in distributed, dynamic, online, and quantum settings ·
Graph Algorithms: Distributed Meets Dynamic, Dagstuhl, Germany
- 29 August 2024 ·
Limits of distributed computing ·
Helsinki Algorithms & Theory Days
- 17 May 2024 ·
Online locality meets distributed quantum computing ·
HIIT Foundations Friday
- 8 December 2023 ·
Causal limits of distributed quantum computation ·
HIIT Foundations Friday
- 9 December 2022 ·
Locality in online, dynamic, sequential, and distributed graph algorithms ·
HIIT Foundations Friday
- 18 January 2021 ·
What can we do with computers? (video) ·
Installation talk, Aalto University
- 5 March 2018 ·
Locality and distributed scheduling ·
Dagstuhl Seminar on Scheduling, Dagstuhl, Germany
- 24 June 2013 ·
Introduction to distributed graph algorithms ·
Aalto University
- 9 January 2012 ·
Verkon värittämistä hajautetuilla algoritmeilla (in Finnish) ·
University of Helsinki
- 26 February 2010 ·
Models of distributed computing: port numbering and local algorithms ·
Finite Model Theory seminar