ResearchTrend.AI
On the Use of Randomness in Local Distributed Graph Algorithms

On the Use of Randomness in Local Distributed Graph Algorithms

M. Ghaffari
Fabian Kuhn
ArXiv (abs)PDFHTML

Papers citing "On the Use of Randomness in Local Distributed Graph Algorithms"

3 / 3 papers shown
Title
Efficient CONGEST Algorithms for the Lovasz Local Lemma
Efficient CONGEST Algorithms for the Lovasz Local Lemma
Yannic Maus
Jara Uitto
57
10
0
05 Aug 2021
Component Stability in Low-Space Massively Parallel Computation
Component Stability in Low-Space Massively Parallel Computation
A. Czumaj
Peter Davies
M. Parter
66
24
0
03 Jun 2021
Deterministic coloring algorithms in the LOCAL model
Deterministic coloring algorithms in the LOCAL model
Dariusz R. Kowalski
Piotr Krysta
33
2
0
30 Jul 2019

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.