8 citations · 8 across the 1 of their papers we have counts for
1 paper
Rahul Sami, Andy Twigg
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the cave…