Sciweavers

FOCS
1994
IEEE
14 years 1 months ago
Randomized and deterministic algorithms for geometric spanners of small diameter
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...
Sunil Arya, David M. Mount, Michiel H. M. Smid
FOCS
1994
IEEE
14 years 1 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
FOCS
1994
IEEE
14 years 1 months ago
On Rank vs. Communication Complexity
This paper concerns the open problem of Lov
Noam Nisan, Avi Wigderson
FOCS
1994
IEEE
14 years 1 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
Theoretical Computer Science
Top of PageReset Settings