Tuomo Lempiäinen

Orcid: 0000-0003-2436-5381

According to our database1, Tuomo Lempiäinen authored at least 9 papers between 2011 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
New classes of distributed time complexity.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
LCL Problems on Grids.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Constant Space and Non-Constant Time in Distributed Computing.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016
A lower bound for the distributed Lovász local lemma.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015
Weak models of distributed computing, with connections to modal logic.
Distributed Comput., 2015

Ability to Count Is Worth $Θ(Δ)$ Rounds.
CoRR, 2015

2014
Search methods for tile sets in patterned DNA self-assembly.
J. Comput. Syst. Sci., 2014

2011
Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly.
Proceedings of the DNA Computing and Molecular Programming - 17th International Conference, 2011


  Loading...