Sciweavers

FOCS
1994
IEEE
13 years 9 months ago
On Rank vs. Communication Complexity
This paper concerns the open problem of Lov
Noam Nisan, Avi Wigderson
FOCS
1994
IEEE
13 years 9 months ago
Finding the k Shortest Paths
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...
David Eppstein
FOCS
1994
IEEE
13 years 9 months ago
Fast and Lean Self-Stabilizing Asynchronous Protocols
We consrder asynchronous general topology dynamic networks of identical nameless nodes wzth worst-case transient faults. Starting from any faulty configuration, our protocols self...
Gene Itkis, Leonid A. Levin
FOCS
1994
IEEE
13 years 9 months ago
Expander Codes
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 ...
Michael Sipser, Daniel A. Spielman
Theoretical Computer Science
Top of PageReset Settings