Edward Pyne

activity

20212026

most citedBeyond Worst Case Local Computation Algorithms

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.DS2021

Improved Local Computation Algorithms for Constructing Spanners

Rubi Arviv, Lily Chung, Reut Levi +1

A spanner of a graph is a subgraph that preserves lengths of shortest paths up to a multiplicative distortion. For every $k$ , a spanner with size $O (n^{1 + 1/ k})$ and stretch $(2k+1)…

cs.DS2021

Local Access to Random Walks

Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $Ω (t)$ . We desire local access algorithms supporting $\text{position}(G…