23 search results - page 4 / 5 » soda 1994 |
SODA
1994
ACM
13 years 6 months ago
1994
ACM
SODA
1994
ACM
13 years 6 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
SODA
1997
ACM
13 years 6 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
SODA
1994
ACM
13 years 6 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
SODA
1994
ACM
13 years 6 months ago
1994
ACM
Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because...