47 citations · 107 across the 20 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018★ 1 cited
Improved Distributed -Coloring
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn +1
We present a randomized distributed algorithm that computes a -coloring in any non-complete graph with maximum degree in rounds,…
cs.DS2015★ 2 cited
Non-Local Probes Do Not Help with Graph Problems
Mika Göös, Juho Hirvonen, Reut Levi +2
This work bridges the gap between distributed and centralised models of computing in the context of sublinear-time graph algorithms. A priori, typical centralised models of computi…