| 000 -LEADER |
|---|
| fixed length control field |
04983nam a22005655i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| ISBN |
9783540472759 |
| -- |
978-3-540-47275-9 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
004.5 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Algorithm Theory — SWAT '92 |
| Sub Title |
Third Scandinavian Workshop on Algorithm Theory Helsinki, Finland, July 8–10, 1992 Proceedings / |
| Statement of responsibility, etc |
edited by Otto Nurmi, Esko Ukkonen. |
| 260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication |
Berlin, Heidelberg : |
| Name of publisher |
Springer Berlin Heidelberg, |
| Year of publication |
1992. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Number of Pages |
VIII, 436 p. |
| Other physical details |
online resource. |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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 nonconvex polyhedron -- 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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
The papers in this volume were presented at SWAT 92, the Third Scandinavian Workshop on Algorithm Theory. The workshop, 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 for researchers in the area of design and analysis of algorithms. 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 (New results on linear programming and related problems), together with 34 selected contributed papers. Contributions cover algorithms and data structures in all areas, including combinatorics, computational geometry, data bases, parallel and distributed computing, and graphics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Data structures (Computer science). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Combinatorics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Distribution (Probability theory). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Statistics. |
| 650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Data Storage Representation. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Combinatorics. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Probability Theory and Stochastic Processes. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Statistics, general. |
| 650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Data Structures. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Nurmi, Otto. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Ukkonen, Esko. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/3-540-55706-7 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
E-BOOKS |
| 264 #1 - |
|---|
| -- |
Berlin, Heidelberg : |
| -- |
Springer Berlin Heidelberg, |
| -- |
1992. |
| 336 ## - |
|---|
| -- |
text |
| -- |
txt |
| -- |
rdacontent |
| 337 ## - |
|---|
| -- |
computer |
| -- |
c |
| -- |
rdamedia |
| 338 ## - |
|---|
| -- |
online resource |
| -- |
cr |
| -- |
rdacarrier |
| 347 ## - |
|---|
| -- |
text file |
| -- |
PDF |
| -- |
rda |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE |
|---|
| -- |
0302-9743 ; |
