67 citations · 118 across the 26 of their papers we have counts for
3 papers · 1 filter
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,…
Distributed Computation of Mixing Time
Anisur Rahaman Molla, Gopal Pandurangan
The mixing time of a graph is an important metric, which is not only useful in analyzing connectivity and expansion properties of the network, but also serves as a key parameter in…
The Cost of Global Broadcast in Dynamic Radio Networks
Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn +1
We study the single-message broadcast problem in dynamic radio networks. We show that the time complexity of the problem depends on the amount of stability and connectivity of the…