Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Tuomo Lempiäinen"'
Autor:
Christopher Purcell, Juho Hirvonen, Joel Rybicki, Przemyslaw Uznanski, Patric R. J. Östergård, Sebastian Brandt, Tuomo Lempiäinen, Jukka Suomela, Janne H. Korhonen
Publikováno v:
PODC
LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cycles (toroidal 1-dimensional grids): every problem has a complexity of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2e4ce68986f6916b220e9be499daa8a
Autor:
Alkida Balliu, Jukka Suomela, Tuomo Lempiäinen, Juho Hirvonen, Dennis Olivetti, Janne H. Korhonen
Publikováno v:
STOC
A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al. (FOCS 2016), Ghaffari & Su (SODA 2017), Brandt et al. (PODC 2017), and Chang & Pettie (FOCS 2017) -- have advanced our understanding of one of the most fundamental questions in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66472fe18a72f426fc164927116ea1fe
Publikováno v:
Journal of Computer and System Sciences. 80:297-319
The Pattern self-Assembly Tile set Synthesis (PATS) problem, which arises in the theory of structured DNA self-assembly, is to determine a set of coloured tiles that, starting from a bordering seed structure, self-assembles to a given rectangular col
Autor:
Tuomo Lempiäinen
Publikováno v:
LICS
Hella et al. (PODC 2012, Distributed Computing 2015) identified seven different message-passing models of distributed computing---one of which is the port-numbering model---and provided a complete classification of their computational power relative
Autor:
Tuomo Lempiäinen, Juho Hirvonen, Jukka Suomela, Jara Uitto, Orr Fischer, Sebastian Brandt, Joel Rybicki, Barbara Keller
Publikováno v:
STOC
We show that any randomised Monte Carlo distributed algorithm for the Lovasz local lemma requires Omega(log log n) communication rounds, assuming that it finds a correct assignment with high probability. Our result holds even in the special case of d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::597e29975768d276d46059e83e6e377d
https://doi.org/10.1145/2897518.2897570
https://doi.org/10.1145/2897518.2897570
Autor:
Juhana Laurinharju, Kerkko Luosto, Antti Kuusisto, Jonni Virtema, Lauri Hella, Jukka Suomela, Tuomo Lempiäinen, Matti Järvisalo
Publikováno v:
PODC
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and study models of computing that are weaker versions of the widely-studied port-numbering model. In the port-numbering mo
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642236372
DNA Computing and Molecular Programming
DNA Computing and Molecular Programming
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01861456dfd18dd485895736625e67b1
https://doi.org/10.1007/978-3-642-23638-9
https://doi.org/10.1007/978-3-642-23638-9
Publikováno v:
ResearcherID
Lecture Notes in Computer Science ISBN: 9783642236372
DNA
Lecture Notes in Computer Science ISBN: 9783642236372
DNA
We consider the problem of finding, for a given 2D pattern of colored tiles, a minimal set of tile types self-assembling to this pattern in the abstract Tile Assembly Model of Winfree (1998). This Patterned self-Assembly Tile set Synthesis (PATS) pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6f1a7d403789940f9c3a60ba0f6c959
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=ORCID&SrcApp=OrcidOrg&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=WOS:000306630000013&KeyUID=WOS:000306630000013
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=ORCID&SrcApp=OrcidOrg&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=WOS:000306630000013&KeyUID=WOS:000306630000013