Æȷοì
Tuomo Lempiäinen
Tuomo Lempiäinen
¼Ò¼ÓÀ» ¾Ë ¼ö ¾øÀ½
alumni.aalto.fiÀÇ À̸ÞÀÏ È®ÀÎµÊ - ȨÆäÀÌÁö
Á¦¸ñ
Àοë
Àοë
¿¬µµ
A lower bound for the distributed Lovász local lemma
S Brandt, O Fischer, J Hirvonen, B Keller, T Lempiäinen, J Rybicki, ...
STOC 2016 – 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
1372016
Weak models of distributed computing, with connections to modal logic
L Hella, M Järvisalo, A Kuusisto, J Laurinharju, T Lempiäinen, K Luosto, ...
PODC 2012 – 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of ¡¦, 2012
702012
LCL problems on grids
S Brandt, J Hirvonen, JH Korhonen, T Lempiäinen, PRJ Östergård, ...
Proceedings of the ACM Symposium on Principles of Distributed Computing, 101-110, 2017
692017
New classes of distributed time complexity
A Balliu, J Hirvonen, JH Korhonen, T Lempiäinen, D Olivetti, J Suomela
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing ¡¦, 2018
542018
Search methods for tile sets in patterned DNA self-assembly
M Göös, T Lempiäinen, E Czeizler, P Orponen
Journal of Computer and System Sciences 80 (1), 297-319, 2014
182014
Synthesizing small and reliable tile sets for patterned DNA self-assembly
T Lempiäinen, E Czeizler, P Orponen
DNA 2011 – 17th International Conference on DNA Computing and Molecular ¡¦, 2011
142011
A design framework for carbon nanotube circuits affixed on DNA origami tiles
E Czeizler, T Lempiäinen, P Orponen
FNANO 2011 – 8th Annual Conference on Foundations of Nanoscience: Self ¡¦, 2011
52011
A Classification of Weak Models of Distributed Computing
T Lempiäinen
University of Helsinki, 2014
32014
Logic and Complexity in Distributed Computing
T Lempiäinen
Aalto University, 2019
12019
Constant space and non-constant time in distributed computing
T Lempiäinen, J Suomela
arXiv preprint arXiv:1705.03876, 2017
12017
21st International Conference on Principles of Distributed Systems (OPODIS 2017)
L Rodrigues, C Burchert, R Wattenhofer, F Kuhn, P Schneider, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018
2018
Ability to count messages is worth ¥È (¥Ä) rounds in distributed computing
T Lempiäinen
LICS 2016 – 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 357-366, 2016
2016
The PATS Problem: Search Methods and Reliability
T Lempiäinen
University of Helsinki, 2015
2015
Nano architectures for carbon nanotube circuits: design, analysis, and experimental attempts
E Czeizler, T Lempiäinen, P Orponen
Workshop on Language Theory in Biocomputing, 2011
2011
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–14