See the list of publications.
26–27 April 2011
Local algorithms: past, present, future.
MITACS Workshop on Wireless Networks and Mobile Computing, Carleton University.
27 November 2011
Distributed maximal matching: greedy is optimal.
Joint work with Juho Hirvonen.
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.
Joint work with Matti Åstrand.
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.
Joint work with Patrik Floréen, Petteri Kaski, and Valentin Polishchuk.
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.
Joint work with Patrik Floréen, Petteri Kaski, and Valentin Polishchuk.
Distributed Computing Group, ETH Zurich.
2 March 2010
Approximating vertex covers in anonymous networks.
Joint work with Matti Åstrand.
Distributed Computing Group, ETH Zurich.
22 October 2009
Stable matchings from the perspective of distributed algorithms.
Joint work with Patrik Floréen, Petteri Kaski, and Valentin Polishchuk.
Heinz Nixdorf Institute, University of Paderborn.
20 October 2009
Local approximation algorithms for vertex cover.
Joint work with Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, and Jara Uitto.
Heinz Nixdorf Institute, University of Paderborn.
11 September 2008
Local algorithms and max-min linear programs.
Joint work with Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, and Topi Musto.
TU Braunschweig.
9 January 2012
Verkon värittämistä hajautetuilla algoritmeilla (in Finnish).
Public test lecture, University of Helsinki.
26 February 2010
Models of distributed computing: port numbering and local algorithms.
Finite Model Theory seminar.