21 citations · 82 across the 21 of their papers we have counts for
Showing 2017 · cs.DCShow all
3 papers · 2 filters
cs.DC2017★ 13 cited
Deterministic subgraph detection in broadcast CONGEST
Janne H. Korhonen, Joel Rybicki
We present simple deterministic algorithms for subgraph finding and enumeration in the broadcast CONGEST model of distributed computation: -- For any constant , detecting -pa…
cs.DC2017
Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus
Christoph Lenzen, Joel Rybicki
We give fault-tolerant algorithms for establishing synchrony in distributed systems in which each of the nodes has its own clock. Our algorithms operate in a very strong fault…
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…