LEADER 06344nam 22007695 450 001 996465671203316 005 20230323210338.0 010 $a3-540-47566-4 024 7 $a10.1007/BFb0028243 035 $a(CKB)1000000000233679 035 $a(SSID)ssj0000321216 035 $a(PQKBManifestationID)11212663 035 $a(PQKBTitleCode)TC0000321216 035 $a(PQKBWorkID)10276826 035 $a(PQKB)10321229 035 $a(DE-He213)978-3-540-47566-8 035 $a(PPN)155192787 035 $a(EXLCZ)991000000000233679 100 $a20121227d1991 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Data Structures$b[electronic resource] $e2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings /$fedited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro 205 $a1st ed. 1991. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1991. 215 $a1 online resource (X, 502 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v519 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-54343-0 327 $aA case study in comparison based complexity: Finding the nearest value(s) -- On the zone of a surface in a hyperplane arrangement -- Ray-shooting and isotopy classes of lines in 3-dimensional space -- Finding level-ancestors in dynamic trees -- Treewidth of circular-arc graphs+ -- Fully dynamic delaunay triangulation in logarithmic expected time per operation -- On computing the voronoi diagram for restricted planar figures -- The MINSUMCUT problem -- Efficient algorithms for the minimum range cut problems -- Memory access in models of parallel computation: From folklore to synergy and beyond -- Farthest neighbors, maximum spanning trees and related problems in higher dimensions -- Shallow interdistance selection and interdistance enumeration -- Sharing memory in asynchronous message passing systems -- A linear-time scheme for version reconstruction -- The interval skip list: A data structure for finding all intervals that overlap a point -- Geometric knapsack problems -- A fast derandomization scheme and its applications -- Unstructured path problems and the making of semirings -- Neighborhood graphs and geometric embedding -- Finding optimal bipartitions of points and polygons -- Immobilizing a polytope -- What can we learn about suffix trees from independent tries? -- Competitive algorithms for the weighted list update problem -- An optimal algorithm for the rectilinear link center of a rectilinear polygon -- Geometric searching and link distance -- Representing and enumerating edge connectivity cuts in RNC -- Planar graph augmentation problems -- Parametric search and locating supply centers in trees -- On bends and lengths of rectilinear paths: A graph-theoretic approach -- Computing minimum length paths of a given homotopy class -- Approximation algorithms for selecting network centers -- Facility dispersion problems: Heuristics and special cases -- Optimum guard covers and m-watchmen routes for restricted polygons -- Applications of a new space partitioning technique -- Offline algorithms for dynamic minimum spanning tree problems -- An empirical analysis of algorithms for constructing a minimum spanning tree -- A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible -- Dynamically maintaining the visibility graph -- An optimal algorithm for computing visibility in the plane -- Fully persistent data structures for disjoint set union problems -- Algorithms for generating all spanning trees of undirected, directed and weighted graphs -- Sorting multisets and vectors in-place -- Probabilistic leader election on rings of known size. 330 $aThis volume presents the proceedings of the Second Workshop on Algorithms and Data Structures (WADS '91), held at Carleton University in Ottawa. The workshop was organized by the School of Computer Science at Carleton University. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the tradition of SWAT '88 (LNCS, Vol. 318), WADS '89 (LNCS, Vol. 382), and SWAT '90 (LNCS, Vol. 447). From 107 papers submitted, 37 were selected for presentation at the workshop. In addition, there were 5 invited presentations. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v519 606 $aAlgorithms 606 $aComputers 606 $aCombinatorics 606 $aProbabilities 606 $aStatistics  606 $aInformation storage and retrieval 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aProbability Theory and Stochastic Processes$3https://scigraph.springernature.com/ontologies/product-market-codes/M27004 606 $aStatistics, general$3https://scigraph.springernature.com/ontologies/product-market-codes/S0000X 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 615 0$aAlgorithms. 615 0$aComputers. 615 0$aCombinatorics. 615 0$aProbabilities. 615 0$aStatistics . 615 0$aInformation storage and retrieval. 615 14$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 615 24$aCombinatorics. 615 24$aProbability Theory and Stochastic Processes. 615 24$aStatistics, general. 615 24$aInformation Storage and Retrieval. 676 $a005.7/3 702 $aDehne$b Frank$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSack$b Jörg-Rüdiger$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSantoro$b N$g(Nicola),$f1951-$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWADS '91 906 $aBOOK 912 $a996465671203316 996 $aAlgorithms and Data Structures$91967417 997 $aUNISA