LEADER 07712nam 22007815 450 001 996465874003316 005 20230323210609.0 010 $a3-540-47918-X 024 7 $a10.1007/3-540-57155-8 035 $a(CKB)1000000000234001 035 $a(SSID)ssj0000321217 035 $a(PQKBManifestationID)11260283 035 $a(PQKBTitleCode)TC0000321217 035 $a(PQKBWorkID)10262860 035 $a(PQKB)10305958 035 $a(DE-He213)978-3-540-47918-5 035 $a(PPN)155171372 035 $a(EXLCZ)991000000000234001 100 $a20121227d1993 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Data Structures$b[electronic resource] $eThird Workshop, WADS '93, Montreal, Canada, August 11-13, 1993. Proceedings /$fedited by Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro, Sue Whitesides 205 $a1st ed. 1993. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1993. 215 $a1 online resource (XII, 636 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v709 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57155-8 327 $aComputing the all-pairs longest chains in the plane -- Towards a better understanding of pure packet routing -- Tolerating faults in meshes and other networks -- A generalization of binary search -- Groups and algebraic complexity -- Connected component and simple polygon intersection searching -- An optimal algorithm for finding the separation of simple polygons -- Balanced search trees made simple -- Probing a set of hyperplanes by lines and related problems -- A general lower bound on the I/O-complexity of comparison-based algorithms -- Point probe decision trees for geometric concept classes -- A dynamic separator algorithm -- Online load balancing of temporary tasks -- Connected domination and steiner set on asteroidal triple-free graphs -- The complexity of finding certain trees in tournaments -- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) -- Separating the power of EREW and CREW PRAMs with small communication width -- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs -- Parallel construction of quadtrees and quality triangulations -- Pattern matching for permutations -- Filling polyhedral molds -- Deferred-query?An efficient approach for problems on interval and circular-arc graphs -- On the complexity of graph embeddings -- Algorithms for polytope covering and approximation -- Global strategies for augmenting the efficiency of TSP heuristics -- Static and dynamic algorithms for k-point clustering problems -- Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers -- Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract) -- The K-D heap: An efficient multi-dimensional priority queue -- A complete and efficient algorithm for the intersection of a general and a convex polyhedron -- Computing the smallest k-enclosing circle and related problems -- An index data structure for matrices, with applications to fast two-dimensional pattern matching -- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects -- Further results on generalized intersection searching problems: Counting, reporting, and dynamization -- Generalized approximate algorithms for point set congruence -- Approximating shortest superstrings with constraints -- Tree reconstruction from partial orders -- Improved parallel depth-first search in undirected planar graphs -- On approximating the longest path in a graph -- Designing multi-commodity flow trees -- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs -- On fat partitioning, fat covering and the union size of polygons -- A time-randomness tradeoff for selection in parallel -- Detecting race conditions in parallel programs that use one semaphore -- An algorithm for finding predecessors in integer sets -- The exhaustion of shared memory: Stochastic results -- Minimum weight euclidean matching and weighted relative neighborhood graphs -- Efficient approximate shortest-path queries among isothetic rectangular obstacles -- Counting and reporting red/blue segment intersections -- Repetitive hidden-surface-removal for polyhedral scenes -- On reconfigurability of VLSI linear arrays -- Reconstructing strings from substrings (Extended abstract) -- Combinatorial complexity of signed discs -- Fast algorithms for one-dimensionsal compaction with jog insertion -- An optimal algorithm for roundness determination on convex polygons -- Practical algorithms on partial k-trees with an application to domination-like problems -- Greedy algorithms for the on-line steiner tree and generalized steiner problems. 330 $aThe papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v709 606 $aComputers 606 $aComputer programming 606 $aMathematical analysis 606 $aAnalysis (Mathematics) 606 $aAlgorithms 606 $aCombinatorics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aAnalysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M12007 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 615 0$aComputers. 615 0$aComputer programming. 615 0$aMathematical analysis. 615 0$aAnalysis (Mathematics). 615 0$aAlgorithms. 615 0$aCombinatorics. 615 14$aTheory of Computation. 615 24$aProgramming Techniques. 615 24$aAnalysis. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 615 24$aCombinatorics. 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 702 $aWhitesides$b Sue$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWADS ®93 906 $aBOOK 912 $a996465874003316 996 $aAlgorithms and Data Structures$91967417 997 $aUNISA