## Algorithm Theory - SWAT '94: 4th Scandianvian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994. ProceedingsThis volume constitutes the proceedings of SWAT '94, the 4th Scandinavian Workshop on Algorithm Theory, held in Aarhus, Denmark in July 1994. The SWAT events are organized each even year and alternate with the WADS meetings (Workshops on Algorithms and Data Structures) held each odd year in North America. The volume contains 31 papers selected from a total of 100 submissions and 3 invited presentations by Michael Fredman (Rutgers), Johan Hastad (Stockholm), and Ketan Mulmuley (Chicago). The contributions cover algorithms and data structures in all areas of computer science and in discrete mathematics, particularly including graph theory, computational geometry, and databases. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Computing Depth Orders and Related Problems 1 | xi |

New OnLine Algorithms for the Page Replication Problem | 25 |

A New Algorithm for the Construction of Optimal BTrees | 49 |

Copyright | |

5 other sections not shown

### Other editions - View all

Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory ... Torben Hagerup,Jyrki Katajainen No preview available - 2004 |

Algorithm Theory - SWAT '92: Third Scandinavian Workshop on Algorithm Theory ... Otto Nurmi,Esko Ukkonen No preview available - 1992 |

### Common terms and phrases

0(n log array assume B-tree binary binary space partition boundary cell cell probe model chain complexity components Computational Geometry Computer Science connected consider constant construct contains convex polygon corresponding cost data structure decomposition defined denote disjoint distance-hereditary graph edges element embedding endpoint envelope given graph G grid half-spaces Hence histogram independent set input intersection interval label Lemma length line segments linear log2 lower bound lowest common ancestor LT-RAM machine maximal maximum memory minimum node NP-complete O(logn obtain on-line algorithm optimal solution pair parallel algorithms partition path planar graph plane polynomial preprocessing problem Proc processors Proof query r-dominating clique random ratio rectilinear rectilinear polygon recursively request resp scheduling separating triangles sequence simple polygon solved space steps subgraph subtree superstring Symposium techniques Theorem topological embedding translates tree tree-decomposition vertex vertices Voronoi diagram weakly-visible chords weighted