Algorithms and Data Structures de Frank Dehne

Algorithms and Data Structures

Frank Dehne

Jörg-Rüdiger Sack

Nicola Santoro

This book contains the papers presented at the 1989 Workshop on Algorithms and Data Structures, which succeeds the 1988 Scandinavian Workshop on Algorithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.

Citește tot Restrânge

Toate formatele și edițiile

	Preț	Express
Paperback (2)	333^.02 lei 6-8 săpt.
Springer – 24 iul 1991	333^.02 lei 6-8 săpt.
Springer – 2 aug 1989	337^.93 lei 6-8 săpt.

Cuprins

Efficient text searching of regular expressions.- Efficient spatial point location.- Constructing the Voronoi diagram of a set of line segments in parallel.- Analysis of kdt-trees: Kd-trees improved by local reorganisations.- Optimal algorithms for List Indexing and Subset Rank.- The Delaunay triangulation closely approximates the complete Euclidean graph.- Computing the furthest site voronoi diagram for a set of discs.- Fully persistent arrays.- String searching algorithms revisited.- Optimal channel placement for multi-terminal nets.- Computing the minimum visible vertex distance between two polygons.- Computing the kernel of a point set in a polygon.- Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs.- Linear time algorithms for computing reachability regions from polygonal figures.- Computing the center of area of a polygon.- Weighted orthogonal linear L ?-approximation and applications.- Discs and other related data structures.- Digital data structures and order statistics.- On the performance of orthogonal range queries in multiattribute and doubly chained trees.- Probabilistic analysis of algorithms and data structures.- Stabbing parallel segments with a convex polygon.- Selecting the Kth largest-area convex polygon.- Finding All Shortest Path Edge Sequences on a convex polyhedron.- Linear algorithms for parity path and two path problems on circular-arc graph.- NC algorithms for circular-arc graphs.- Parallel algorithms for the subgraph homeomorphism problem.- Galleries, light matchings and visibility graphs.- Weighted visibility graphs of bars and related flow problems.- Parallel algorithms for cographs recognition and applications.- Dynamic data structures for series parallel digraphs.- Motion planning in theCL-environment.- Self-adjusting k-ary search trees.- Improving partial rebuilding by using simple balance criteria.- An efficient all-parses systolic algorithm for general context-free parsing.- A polynomial time algorithm for the local testability problem of deterministic finite automata.- Skip lists: A probabilistic alternative to balanced trees.- A fast algorithm for melding splay trees.- An efficient algorithm for finding all maximal square blocks in a matrix.- Complexity issues in tree-based version control.- Structured NC.- Heapsort—Adapted for presorted files.- The distribution of keys in a binary heap.- Optimal hypercube algorithms for labeled images.- On the complexity of single row routing problems.- A new search time update time tradeoff for the implicit dictionary.- Sorting with minimum data movement (preliminary draft).- Augmentation problems on hierarchically defined graphs.- On linear time minor tests and depth first search.- Combinatorial and computational results for line arrangements in space.