activity
20122017
most citedWeak Models of Distributed Computing, with Connections to Modal Logic

31 citations · 58 across the 4 of their papers we have counts for

collaborators

5 papers

cs.DC2017

New Classes of Distributed Time Complexity

Alkida Balliu, Juho Hirvonen, Janne H. Korhonen +3

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…

cs.DC2017★ 1 cited

LCL problems on grids

Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen +6

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 cy…

cs.DC2015★ 8 cited

A Lower Bound for the Distributed Lovász Local Lemma

Sebastian Brandt, Orr Fischer, Juho Hirvonen +5

We show that any randomised Monte Carlo distributed algorithm for the Lovász local lemma requires communication rounds, assuming that it finds a correct assignment…

cs.ET2014★ 18 cited

Search Methods for Tile Sets in Patterned DNA Self-Assembly

Mika Göös, Tuomo Lempiäinen, Eugen Czeizler +1

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…

cs.DC2012★ 31 cited

Weak Models of Distributed Computing, with Connections to Modal Logic

Lauri Hella, Matti Järvisalo, Antti Kuusisto +5

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 version…