LEADER 04753oam 2200553 450 001 996466137603316 005 20210714201031.0 010 $a3-540-68530-8 024 7 $a10.1007/3-540-68530-8 035 $a(CKB)1000000000210963 035 $a(SSID)ssj0000321197 035 $a(PQKBManifestationID)11254885 035 $a(PQKBTitleCode)TC0000321197 035 $a(PQKBWorkID)10263055 035 $a(PQKB)10856818 035 $a(DE-He213)978-3-540-68530-2 035 $a(MiAaPQ)EBC3071832 035 $a(MiAaPQ)EBC6485798 035 $a(PPN)155210653 035 $a(EXLCZ)991000000000210963 100 $a20210714d1998 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aAlgorithms--ESA '98 $e6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings /$fEdited by Gianfranco Bilardi [and three others] 205 $a1st ed. 1998. 210 1$aBerlin, Germany :$cSpringer,$d[1998] 210 4$d©1998 215 $a1 online resource (XII, 524 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1461 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-64848-8 320 $aIncludes bibliographical references and index. 327 $aInvited Lectures -- External Memory Algorithms -- Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper) -- Data Structures -- Car-Pooling as a Data Structuring Device: The Soft Heap -- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property -- Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures -- Strings and Biology -- Augmenting Suffix Trees, with Applications -- Longest Common Subsequence from Fragments via Sparse Dynamic Programming -- Computing the Edit-Distance Between Unrooted Ordered Trees -- Analogs and Duals of the MAST Problem for Sequences and Trees -- Numerical Algorithms -- Complexity Estimates Depending on Condition and Round-Off Error -- Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting -- Fast Algorithms for Linear Algebra Modulo N -- A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers -- Geometry -- Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time -- A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract) -- Positioning Guards at Fixed Height Above a Terrain ? An Optimum Inapproximability Result -- Two-Center Problems for a Convex Polygon (Extended Abstract) -- Constructing Binary Space Partitions for Orthogonal Rectangles in Practice -- Randomized and On-Line Algorithms -- A Fast Random Greedy Algorithm for the Component Commonality Problem -- Maximizing Job Completions Online -- A Randomized Algorithm for Two Servers on the Line (Extended Abstract) -- Parallel and Distributed Algorithms I -- On Nonblocking Properties of the Bene? Network -- Adaptability and the Usefulness of Hints (Extended Abstract) -- Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract) -- New Bounds for Oblivious Mesh Routing -- Evaluating Server-Assisted Cache Replacement in the Web -- Graph Algorithms -- Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights -- A Functional Approach to External Graph Algorithms -- Minimal Triangulations for Graphs with ?Few? Minimal Separators -- Finding an Optimal Path without Growing the Tree -- An Experimental Study of Dynamic Algorithms for Directed Graphs -- Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme -- Parallel and Distributed Algorithms II -- ?-Stepping : A Parallel Single Source Shortest Path Algorithm -- Improved Deterministic Parallel Padded Sorting -- Analyzing an Infinite Parallel Job Allocation Process -- Nearest Neighbor Load Balancing on Graphs -- Optimization -- 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves -- Moving-Target TSP and Related Problems -- Fitting Points on the Real Line and Its Application to RH Mapping -- Approximate Coloring of Uniform Hypergraphs (Extended Abstract) -- Techniques for Scheduling with Rejection -- Computer-Aided Way to Prove Theorems in Scheduling. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1461 606 $aComputer algorithms$vCongresses 615 0$aComputer algorithms 676 $a004.015118 702 $aBilardi$b G. 712 12$aESA '98 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996466137603316 996 $aAlgorithms--ESA '98$92017466 997 $aUNISA