Del 621 - Lecture Notes in Computer Science

Algorithm Theory - SWAT '92

Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992. Proceedings

Häftad, Engelska, 1992

Av Otto Nurmi, Esko Ukkonen

719 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

The papers in this volume were presented at SWAT 92, theThird Scandinavian Workshop on Algorithm Theory. Theworkshop, which continues the tradition ofSWAT 88, SWAT 90,and the Workshop on Algorithms and Data Structures (WADS 89,WADS 91), is intended as an international forum forresearchers in the area of design and analysis ofalgorithms. The volume contains invited papers by L.G.Valiant (Direct bulk-synchronous parallel algorithms), A.A.Razborov (On small depth threshold circuits), G. Gonnet(Efficient two-dimensional searching), and E. Welzl (Newresults on linear programming and related problems),together with 34 selected contributed papers. Contributionscover algorithms and data structures in all areas, includingcombinatorics, computational geometry, data bases, paralleland distributed computing, and graphics.

Produktinformation

Utgivningsdatum1992-06-24
Mått155 x 233 x 24 mm
Vikt668 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor436
Upplaga1992
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540557067

Tillhör följande kategorier

Tillämpad matematik inom Naturvetenskap och teknik
Systemvetenskap och AI inom Data och it
Diskret matematik inom Naturvetenskap och teknik
Matematisk statistik inom Naturvetenskap och teknik
Databaser inom Data och it

Direct bulk-synchronous parallel algorithms.- Memory limited inductive inference machines.- Retrieval of scattered information by EREW, CREW and CRCW PRAMs.- On small depth threshold circuits.- An elementary approach to some analytic asymptotics.- An optimal parallel algorithm for computing a near-optimal order of matrix multiplications.- Generating sparse 2—spanners.- Low-diameter graph decomposition is in NC.- Parallel algorithm for cograph recognition with applications.- Parallel algorithms for all minimum link paths and link center problems.- Optimal multi-packet routing on the torus.- Parallel algorithms for priority queue operations.- Heap construction in the parallel comparison tree model.- Efficient rebalancing of chromatic search trees.- The complexity of scheduling problems with communication delays for trees.- The list update problem and the retrieval of sets.- Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization.- Fractional cascading simplified.- Dynamic 2- and 3-connectivity on planar graphs.- Fully dynamic 2-edge-connectivity in planar graphs.- Non-interfering network flows.- Triangulating planar graphs while minimizing the maximum degree.- How to draw a series-parallel digraph.- Coloring random graphs.- Testing superperfection of k-trees.- Parametric problems on graphs of bounded tree-width.- Efficient two-dimensional searching.- Improvements on geometric pattern matching problems.- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs.- New results on linear programming and related problems.- Dynamic closest pairs — A probabilistic approach.- Two- and three- dimensional point location in rectangular subdivisions.- Decomposing the boundary of a nonconvexpolyhedron.- Convex polygons made from few lines and convex decompositions of polyhedra.- Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity.- Voronoi diagrams of moving points in higher dimensional spaces.- Sorting multisets stably in minimum space.- A framework for adaptive sorting.