What people are saying - Write a review
We haven't found any reviews in the usual places.
Lower Bounds to ProcessorTime Tradeoffs
On some Geometric Selection and Optimization Problems
Balanced Distributed Search Trees Do Not Exist
21 other sections not shown
Other editions - View all
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