92 citations · 156 across the 18 of their papers we have counts for
5 papers · 1 filter
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…
Distributed Colour Reduction Revisited
Jukka Kohonen, Janne H. Korhonen, Christopher Purcell +2
We give a new, simple distributed algorithm for graph colouring in paths and cycles. Our algorithm is fast and self-contained, it does not need any globally consistent orientation,…
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…
Towards a complexity theory for the congested clique
Janne H. Korhonen, Jukka Suomela
The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on…
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…