13 citations · 23 across the 12 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DC2022
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse +1
We consider global problems, i.e. problems that take at least diameter time, even when the bandwidth is not restricted. We show that all problems considered admit efficient solutio…
cs.NI2022★ 1 cited
FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches
Wenchen Han, Vic Feng, Gregory Schwartzman +4
Optimizing the reaction to network events, which is critical in tasks such as clock synchronization, multicast, and routing, becomes increasingly challenging as networks grow large…