1 citations · 1 across the 3 of their papers we have counts for
3 papers
Hash & Adjust: Competitive Demand-Aware Consistent Hashing
Arash Pourdamghani, Chen Avin, Robert Sama +2
Distributed systems often serve dynamic workloads and resource demands evolve over time. Such a temporal behavior stands in contrast to the static and demand-oblivious nature of mo…
The Singular Optimality of Distributed Computation in LOCAL
Fabien Dufoulon, Gopal Pandurangan, Peter Robinson +1
It has been shown that one can design distributed algorithms that are (nearly) singularly optimal, meaning they simultaneously achieve optimal time and message complexity (within p…
Fully-Distributed Byzantine Agreement in Sparse Networks
John Augustine, Fabien Dufoulon, Gopal Pandurangan
Byzantine agreement is a fundamental problem in fault-tolerant distributed networks that has been studied intensively for the last four decades. Most of these works designed protoc…