18 search results - page 2 / 4 » stoc 1994 |
126
Voted
STOC
1994
ACM
15 years 10 months ago
1994
ACM
146
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
145
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
153
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...