FOCS
1994
IEEE
13 years 7 months ago
1994
IEEE
FOCS
1994
IEEE
13 years 7 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
FOCS
1994
IEEE
13 years 7 months ago
1994
IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
This paper concerns the open problem of Lov
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
FOCS
1994
IEEE
13 years 8 months ago
1994
IEEE
We consrder asynchronous general topology dynamic networks of identical nameless nodes wzth worst-case transient faults. Starting from any faulty configuration, our protocols self...