131
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
106
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
110
click to vote
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitiv...
66
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
STOC
1994
ACM
15 years 4 months ago
1994
ACM
98
Voted
STOC
1994
ACM
15 years 4 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...
101
Voted
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
109
click to vote
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
149
click to vote
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
80
Voted
STOC
1994
ACM
15 years 4 months ago
1994
ACM