6 citations · 9 across the 16 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2023
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao +5
This paper presents parallel, distributed and quantum algorithms for single-source shortest paths when edges can have negative weights (negative-weight SSSP). We show a framework t…
cs.DC2010★ 3 cited
Analyzing Network Coding Gossip Made Easy
Bernhard Haeupler
We give a new technique to analyze the stopping time of gossip protocols that are based on random linear network coding (RLNC). Our analysis drastically simplifies, extends and str…