3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DC2020★ 1 cited
How fast can you update your MST? (Dynamic algorithms for cluster computing)
Seth Gilbert, Lawrence Li
Imagine a large graph that is being processed by a cluster of computers, e.g., described by the -machine model or the Massively Parallel Computation Model. The graph, however, i…
cs.NI2019★ 3 cited
Cooperation Speeds Surfing: Use Co-Bandit!
Anuja Meetoo Appavoo, Seth Gilbert, Kian-Lee Tan
In this paper, we explore the benefit of cooperation in adversarial bandit settings. As a motivating example, we consider the problem of wireless network selection. Mobile devices…
cs.DC2019
Leader Election in Well-Connected Graphs
Seth Gilbert, Peter Robinson, Suman Sourav
In this paper, we look at the problem of randomized leader election in synchronous distributed networks with a special focus on the message complexity. We provide an algorithm that…