Shashwat Chandra
YOU?
Author Swipe
View article: Improved All-Pairs Approximate Shortest Paths in Congested Clique
Improved All-Pairs Approximate Shortest Paths in Congested Clique Open
View article: Fast Broadcast in Highly Connected Networks
Fast Broadcast in Highly Connected Networks Open
View article: Improved All-Pairs Approximate Shortest Paths in Congested Clique
Improved All-Pairs Approximate Shortest Paths in Congested Clique Open
In this paper, we present new algorithms for approximating All-Pairs Shortest Paths (APSP) in the Congested Clique model. We present randomized algorithms for weighted undirected graphs. Our first contribution is an $O(1)$-approximate APSP…
View article: Fast Broadcast in Highly Connected Networks
Fast Broadcast in Highly Connected Networks Open
We revisit the classic broadcast problem, wherein we have $k$ messages, each composed of $O(\log{n})$ bits, distributed arbitrarily across a network. The objective is to broadcast these messages to all nodes in the network. In the distribu…