3 citations · 7 across the 8 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DC2024★ 1 cited
Deterministic Expander Routing: Faster and More Versatile
Yi-Jun Chang, Shang-En Huang, Hsin-Hao Su
We consider the expander routing problem formulated by Ghaffari, Kuhn, and Su (PODC 2017), where the goal is to route all the tokens to their destinations given that each vertex is…
cs.DS2024
Improved All-Pairs Approximate Shortest Paths in Congested Clique
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang +2
In this paper, we present a new randomized -approximation algorithm for the All-Pairs Shortest Paths (APSP) problem in weighted undirected graphs that runs in just $O(\log \l…
cs.DC2024
Fast Broadcast in Highly Connected Networks
Shashwat Chandra, Yi-Jun Chang, Michal Dory +2
We revisit the classic broadcast problem, wherein we have messages, each composed of bits, distributed arbitrarily across a network. The objective is to broadcast…