11 search results - page 1 / 3 » swat 1994 |
SWAT
1994
Springer
13 years 8 months ago
1994
Springer
SWAT
1994
Springer
13 years 8 months ago
1994
Springer
SWAT
1994
Springer
13 years 8 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
SWAT
1994
Springer
13 years 8 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...
SWAT
1994
Springer
13 years 8 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...