|
|
|
|
| LEADER |
04462nmm a2200445 u 4500 |
| 001 |
EB000657758 |
| 003 |
EBX01000000000000001349358 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540472759
|
| 100 |
1 |
|
|a Nurmi, Otto
|e [editor]
|
| 245 |
0 |
0 |
|a Algorithm Theory - SWAT '92
|h Elektronische Ressource
|b Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992. Proceedings
|c edited by Otto Nurmi, Esko Ukkonen
|
| 250 |
|
|
|a 1st ed. 1992
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1992, 1992
|
| 300 |
|
|
|a VIII, 436 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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 --
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Statistics
|
| 653 |
|
|
|a Probability Theory
|
| 653 |
|
|
|a Information retrieval
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Applications of Mathematics
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Statistics
|
| 653 |
|
|
|a Data Storage Representation
|
| 653 |
|
|
|a Mathematics
|
| 653 |
|
|
|a Computer architecture
|
| 653 |
|
|
|a Probabilities
|
| 700 |
1 |
|
|a Ukkonen, Esko
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-55706-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-55706-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a 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
|