000 03881nam a22004695i 4500
001 978-3-540-39288-0
003 DE-He213
005 20160624101943.0
007 cr nn 008mamaa
008 121227s1988 gw | s |||| 0|eng d
020 _a9783540392880
_9978-3-540-39288-0
024 7 _a10.1007/3-540-19487-8
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aSWAT 88
_h[electronic resource] :
_b1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings /
_cedited by Rolf Karlsson, Andrzej Lingas.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1988.
300 _aVIII, 264 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 ;
_v318
505 0 _aAn implicit binomial queue with constant insertion time -- Implicit selection -- An extrapolation on the interpolation search -- Time parameter and arbitrary deunions in the set union problem -- Two new algorithms for constructing min-max heaps -- Extremal cost tree data structures -- Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques -- Problems of posting sentries: Variations on the art gallery theorem -- A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons -- On recognizing and characterizing visibility graphs of simple polygons -- Connectability problems -- Two hybrid methods for collision resolution in open addressing hashing -- On an alternative sum useful in the analysis of some data structures -- Bin-packing in 1.5 dimension -- Applications of a symbolic perturbation scheme -- A fast parallel algorithm for computing all maximal cliques in a graph and the related problems -- Parallel solution of sparse linear systems -- A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors -- Probabilistic log-space reductions and problems probabilistically hard for p -- Searching with uncertainty extended abstract -- An optimal expected-time parallel algorithm for Voronoi diagrams -- Generating binary trees by transpositions -- Approximating the complete Euclidean graph -- Upper and lower bounds for the dictionary problem -- Linear algorithms for graph separation problems -- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees -- NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems -- Independent covers in outerplanar graphs -- Tight lower bounds for Shellsort.
520 _aThe papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.
650 0 _aComputer science.
650 0 _aComputer software.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aKarlsson, Rolf.
_eeditor.
700 1 _aLingas, Andrzej.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540194873
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v318
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-19487-8
942 _2EBK4620
_cEBK
999 _c33914
_d33914