Matti Åstrand

Contact information

Email: matti@math.upenn.edu
Office: 4C17 David Rittenhouse Laboratory

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks, Matti Åstrand and Jukka Suomela, 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Santorini, Greece, June 2010.
© ACM, 2010. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proc. 22nd ACM Symposium on Parallelism in Algorithms and Architectures. http://doi.acm.org/10.1145/1810479.1810533
Local algorithms in (weakly) coloured graphs, Matti Åstrand, Valentin Polishchuk, Joel Rybicki, Jukka Suomela and Jara Uitto, 2010.
A local 2-approximation algorithm for the vertex cover problem, Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, and Jara Uitto, 23rd International Symposium on Distributed Computing (DISC), Elche, Spain, September 2009.
Publisher's version. The original publication is available at www.springerlink.com.

Proäärelliset ryhmät ja kuntalaajennukset (in Finnish). MSc thesis, University of Helsinki, Department of Mathematics and Statistics. May 2009.
Vahvasti minimaaliset ryhmät (in Finnish). BSc thesis, University of Helsinki, Department of Mathematics and Statistics. December 2008.