LEADER 06476nam 22007575 450 001 996466132503316 005 20230323210821.0 010 $a3-540-44747-4 024 7 $a10.1007/3-540-60220-8 035 $a(CKB)1000000000234322 035 $a(SSID)ssj0000321218 035 $a(PQKBManifestationID)11256252 035 $a(PQKBTitleCode)TC0000321218 035 $a(PQKBWorkID)10262646 035 $a(PQKB)10695496 035 $a(DE-He213)978-3-540-44747-4 035 $a(PPN)155223399 035 $a(EXLCZ)991000000000234322 100 $a20121227d1995 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Data Structures$b[electronic resource] $e4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings /$fedited by Selim G. Akl, Frank Dehne, Jörg-Rüdiger Sack, Nicola Santoro 205 $a1st ed. 1995. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995. 215 $a1 online resource (X, 526 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v955 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-60220-8 327 $aLower bounds to processor-time tradeoffs under bounded-speed message propagation -- The two-line center problem from a polar view: a new algorithm and data structure -- On some geometric selection and optimization problems via sorted matrices -- Load balancing in quorum systems -- Balanced distributed search trees do not exist -- Two-floodlight illumination of convex polygons -- On the complexity of approximating and illuminating three-dimensional convex polyhedra -- Scheduling jobs that arrive over time -- Dynamic algorithms for the Dyck languages -- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications -- Computing a shortest watchman path in a simple polygon in polynomial-time -- Going home through an unknown street -- Page migration with limited local memory capacity -- Randomized algorithms for metrical task systems -- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining -- Computing common tangents without a separating line -- Online perfect matching and mobile computing -- Competitive algorithms for the on-line traveling salesman -- Quadrangulations of planar sets -- A linear-time construction of the relative neighborhood graph within a histogram -- Computing proximity drawings of trees in the 3-dimensional space -- Routing on trees via matchings -- A ranking algorithm for Hamilton paths in shuffle-exchange graphs -- Amortization results for chromatic search trees, with an application to priority queues -- Fast meldable priority queues -- On the computation of fast data transmissions in networks with capacities and delays -- Routing with delays when storage is costly -- Algorithmic arguments in physics of computation -- The buffer tree: A new technique for optimal I/O-algorithms -- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep -- Computing a dominating pair in an asteroidal triple-free graph in linear time -- A linear algorithm for the maximal planar subgraph problem -- Topology B-trees and their applications -- In-place calculation of minimum-redundancy codes -- Regular-factors in the complements of partial k-trees -- Obstructions to within a few vertices or edges of acyclic -- Faster enumeration of all spanning trees of a directed graph -- A simpler minimum spanning tree verification algorithm -- On approximation properties of the Independent set problem for degree 3 graphs -- Approximation of Constraint Satisfaction via local search -- On the difficulty of range searching -- Tables should be sorted (on random access machines) -- Improved length bounds for the shortest superstring problem -- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) -- Experiences with the implementation of geometric algorithms. 330 $aThis volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in August 1995. The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v955 606 $aComputers 606 $aComputer programming 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aComputer graphics 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 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputers. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aData structures (Computer science). 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aProgramming Techniques. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aData Structures. 615 24$aComputer Graphics. 676 $a005.1 702 $aAkl$b Selim G$4edt$4http://id.loc.gov/vocabulary/relators/edt 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 '95 906 $aBOOK 912 $a996466132503316 996 $aAlgorithms and Data Structures$91967417 997 $aUNISA