193 citations · 274 across the 24 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DM2011★ 4 cited
Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance
Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner +1
In this paper, we study the question of how efficiently a collection of interconnected nodes can perform a global computation in the widely studied GOSSIP model of communication. I…
cs.SI2011
Topology Discovery of Sparse Random Graphs With Few Participants
Animashree Anandkumar, Avinatan Hassidim, Jonathan Kelner
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. Th…