FOCS
13 years 9 months ago
1994 IEEE
This paper concerns the open problem of Lov
FOCS
13 years 9 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
13 years 9 months ago
1994 IEEE FOCS
13 years 9 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...
FOCS
13 years 9 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 ...
|