5 citations · 9 across the 3 of their papers we have counts for
3 papers
cs.DC2019
Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol
Frederik Mallmann-Trenn, Yannic Maus, Dominik Pajak
We study a process of \emph{averaging} in a distributed system with \emph{noisy communication}. Each of the agents in the system starts with some value and the goal of each agent i…
cs.SI2016★ 5 cited
Greedy Routing and the Algorithmic Small-World Phenomenom
Karl Bringmann, Ralph Keusch, Johannes Lengler +2
The algorithmic small-world phenomenon, empirically established by Milgram's letter forwarding experiments from the 60s, was theoretically explained by Kleinberg in 2000. However,…
cs.DC2016★ 4 cited
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model
Dan Hefetz, Fabian Kuhn, Yannic Maus +1
We show an lower bound on the runtime of any deterministic distributed -graph coloring algorithm in a weak vari…