My research interests lie in discrete mathematics, logic and theory of computing. In my doctoral research I focus on the theoretical foundations of distributed computing. In particular I aim to develop descriptive complexity theory in a distributed setting.
Weak models of distributed computing, with connections to modal logic. Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela and Jonni Virtema. Distributed Computing, volume 28, issue 1, pages 31-53, February 2015. Publisher's version · Authors' version · arXiv
Search methods for tile sets in patterned DNA self-assembly. Mika Göös, Tuomo Lempiäinen, Eugen Czeizler and Pekka Orponen. Journal of Computer and System Sciences, volume 80, issue 1, pages 297-319, February 2014. Publisher's version · Authors' version · arXiv
Refereed conference papers
New classes of distributed time complexity. Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti and Jukka Suomela. Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC, Los Angeles, CA, USA, June 2018). To appear. arXiv
Constant space and non-constant time in distributed computing. Tuomo Lempiäinen and Jukka Suomela. Proceedings of the 21st International Conference on Principles of Distributed Systems (OPODIS, Lisbon, Portugal, December 2017). To appear. arXiv
LCL problems on grids. Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela and Przemysław Uznański. Proceedings of the 36th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC, Washington, DC, USA, July 2017), pages 101-110. ACM, 2017. Publisher's version · arXiv
Ability to count messages is worth Θ(Δ) rounds in distributed computing. Tuomo Lempiäinen. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS, New York, NY, USA, July 2016), pages 357-366. ACM, 2016. Publisher's version · Authors' version · arXiv
A lower bound for the distributed Lovász local lemma. Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela and Jara Uitto. Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC, Cambridge, MA, USA, June 2016), pages 479-488. ACM, 2016. Publisher's version · Authors' version · arXiv
Weak models of distributed computing, with connections to modal logic. Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela and Jonni Virtema. Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC, Funchal, Madeira, Portugal, July 2012), pages 185-194. ACM, 2012. Publisher's version · Authors' version · Journal version
Synthesizing small and reliable tile sets for patterned DNA self-assembly. Tuomo Lempiäinen, Eugen Czeizler and Pekka Orponen. Proceedings of the 17th International Conference on DNA Computing and Molecular Programming (DNA, Pasadena, CA, USA, September 2011), volume 6937 of LNCS, pages 145-159. Springer, 2011. Publisher's version · Authors' version · Journal version
Other work presented at conferences and workshops
Nano Architectures for Carbon Nanotube Circuits: Design, Analysis, and Experimental Attempts. Eugen Czeizler, Tuomo Lempiäinen and Pekka Orponen. Workshop on Language Theory in Biocomputing (Turku, Finland, June 2011). Extended abstract
Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-Assembly. Tuomo Lempiäinen, Eugen Czeizler and Pekka Orponen. Workshop on Statistical Mechanics and Computation of DNA Self-Assembly (Mariehamn, Finland, May 2011). Poster
A Design Framework for Carbon Nanotube Circuits Affixed on DNA Origami Tiles. Eugen Czeizler, Tuomo Lempiäinen and Pekka Orponen. Proceedings of the 8th Annual Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices (FNANO, Snowbird, UT, USA, April 2011), pages 186-187. Extended abstract · Poster
Note that authors are listed in alphabetical order in the theoretical computer science papers.