9 citations · 15 across the 4 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2020
Improved Bounds for Distributed Load Balancing
Sepehr Assadi, Aaron Bernstein, Zachary Langley
In the load balancing problem, the input is an -vertex bipartite graph and a positive weight for each client . The algorithm must assign each client…
cs.DC2018
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
Aaron Bernstein, Danupon Nanongkai
In the {\em distributed all-pairs shortest paths} problem (APSP), every node in the weighted undirected distributed network (the CONGEST model) needs to know the distance from ever…