A randomized algorithm for a search problem is *pseudodeterministic* if ...
We present the first compact distance oracle that tolerates multiple fai...
We continue the study of distance sensitivity oracles (DSOs). Given a
di...
We consider the problem of building Distance Sensitivity Oracles (DSOs)....
Given an undirected graph G=(V,E) of n vertices and m edges with
weights...