000 | 04764nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-48577-3 | ||
003 | DE-He213 | ||
005 | 20160624102035.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1994 gw | s |||| 0|eng d | ||
020 |
_a9783540485773 _9978-3-540-48577-3 |
||
024 | 7 |
_a10.1007/3-540-58218-5 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYZG _2bicssc |
|
072 | 7 |
_aCOM037000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aAlgorithm Theory — SWAT '94 _h[electronic resource] : _b4th Scandinavian Workshop on Algorithm Theory Aarhus, Denmark, July 6–8, 1994 Proceedings / _cedited by Erik M. Schmidt, Sven Skyum. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1994. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1994. |
|
300 |
_aX, 394 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 ; _v824 |
|
505 | 0 | _aComputing depth orders and related problems -- Selection in monotone matrices and computing k th nearest neighbors -- New on-line algorithms for the page replication problem -- Serving requests with on-line routing -- A new algorithm for the construction of optimal B-trees -- New results on binary space partitions in the plane (extended abstract) -- A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon -- On triangulating planar graphs under the four-connectivity constraint -- Parallel and sequential approximation of shortest superstrings -- Separating translates in the plane: Combinatorial bounds and an algorithm -- Finding all weakly-visible chords of a polygon in linear time -- A tight lower bound for on-line monotonic list labeling -- Trapezoid graphs and generalizations, geometry and algorithms -- Optimal parametric search on graphs of bounded tree-width -- Lower bounds for dynamic algorithms -- Sequential and parallel algorithms for embedding problems on classes of partial k-trees -- On intersection searching problems involving curved objects -- Improved approximations of independent sets in bounded-degree graphs -- Asymptotically optimal election on weighted rings -- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes -- Recent results in hardness of approximation -- The parallel hierarchical memory model -- Randomized geometric algorithms (abstract) -- Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments -- On self-stabilizing wait-free clock synchronization -- Hard graphs for randomized subgraph exclusion algorithms -- Task scheduling in networks -- Parallel dynamic lowest common ancestors -- An O(log log n) algorithm to compute the kernel of a polygon -- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel -- Exploiting locality in LT-RAM computations -- Efficient preprocessing of simple binary pattern forests -- A parallel algorithm for edge-coloring partial k-trees -- Dominating cliques in distance-hereditary graphs. | |
520 | _aThis volume constitutes the proceedings of SWAT '94, the 4th Scandinavian Workshop on Algorithm Theory, held in Aarhus, Denmark in July 1994. The SWAT events are organized each even year and alternate with the WADS meetings (Workshops on Algorithms and Data Structures) held each odd year in North America. The volume contains 31 papers selected from a total of 100 submissions and 3 invited presentations by Michael Fredman (Rutgers), Johan Hastad (Stockholm), and Ketan Mulmuley (Chicago). The contributions cover algorithms and data structures in all areas of computer science and in discrete mathematics, particularly including graph theory, computational geometry, and databases. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aComputer graphics. | |
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aData Storage Representation. |
650 | 2 | 4 | _aCombinatorics. |
650 | 2 | 4 | _aComputer Graphics. |
700 | 1 |
_aSchmidt, Erik M. _eeditor. |
|
700 | 1 |
_aSkyum, Sven. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540582182 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v824 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-58218-5 |
942 |
_2EBK6523 _cEBK |
||
999 |
_c35817 _d35817 |