63 citations · 207 across the 33 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021★ 1 cited
Optimal Oblivious Reconfigurable Networks
Daniel Amir, Tegan Wilson, Vishal Shrivastav +3
Oblivious routing has a long history in both the theory and practice of networking. In this work we initiate the formal study of oblivious routing in the context of reconfigurable…
cs.DS2012★ 4 cited
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
Rachit Agarwal, P. Brighten Godfrey, Sariel Har-Peled
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to approximate shortest paths between any pair of vertices. Any distance…