## Algorithms and Data Structures: Workshop WADS ... |

### What people are saying - Write a review

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

### Contents

Lower Bounds to ProcessorTime Tradeoffs | 1 |

On some Geometric Selection and Optimization Problems | 26 |

Balanced Distributed Search Trees Do Not Exist | 50 |

Copyright | |

21 other sections not shown

### Other editions - View all

Algorithms and Data Structures: 2nd Workshop, WADS '91, Ottawa, Canada ... Frank Dehne,Jörg-Rüdiger Sack,Nicola Santoro No preview available - 1991 |

### Common terms and phrases

approximation B-tree binary bits buffer chain competitive ratio complexity Computational Geometry Computer Science connected consider constant constraints construction contains convex hull cost cycle data structure define Delaunay triangulation DeleteMin deletion denote distributed dynamic elements endpoints folding intervals function given graph G implementation independent set input insert integer intersection Kolmogorov complexity Lemma length linear lower bound machine maximum memory minimal minimum NP-complete O(logn obtain on-line algorithm online algorithm optimal packet pair parallel partition performance planar planar graph pointer points polynomial priority queues problem Proc Proof quadrangulation query quickest path quorum system random rectangles request reversible computation robot routing schedule search tree sequence server shortest path shortest watchman path simple polygon solution spanning tree steps string subgraph subset subtree rooted swap tangent technique Theorem topology tree triangulation update upper bound vertices Voronoi diagrams weighted