000 | 04983nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-47275-9 | ||
003 | DE-He213 | ||
005 | 20160624102021.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1992 gw | s |||| 0|eng d | ||
020 |
_a9783540472759 _9978-3-540-47275-9 |
||
024 | 7 |
_a10.1007/3-540-55706-7 _2doi |
|
050 | 4 | _aQA76.9.D35 | |
072 | 7 |
_aUNF _2bicssc |
|
072 | 7 |
_aUKS _2bicssc |
|
072 | 7 |
_aCOM030000 _2bisacsh |
|
082 | 0 | 4 |
_a004.5 _223 |
245 | 1 | 0 |
_aAlgorithm Theory — SWAT '92 _h[electronic resource] : _bThird Scandinavian Workshop on Algorithm Theory Helsinki, Finland, July 8–10, 1992 Proceedings / _cedited by Otto Nurmi, Esko Ukkonen. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1992. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1992. |
|
300 |
_aVIII, 436 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v621 |
|
505 | 0 | _aDirect 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 | _aThe 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 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aCombinatorics. | |
650 | 0 | _aDistribution (Probability theory). | |
650 | 0 | _aStatistics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aData Storage Representation. |
650 | 2 | 4 | _aCombinatorics. |
650 | 2 | 4 | _aProbability Theory and Stochastic Processes. |
650 | 2 | 4 | _aStatistics, general. |
650 | 2 | 4 | _aData Structures. |
700 | 1 |
_aNurmi, Otto. _eeditor. |
|
700 | 1 |
_aUkkonen, Esko. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540557067 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v621 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-55706-7 |
942 |
_2EBK6031 _cEBK |
||
999 |
_c35325 _d35325 |