Algorithms — ESA’ 98: 6th Annual European Symposium Venice, Italy, August 24–26, 1998 ProceedingsAuthor: Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci Published by Springer Berlin Heidelberg ISBN: 978-3-540-64848-2 DOI: 10.1007/3-540-68530-8Table of Contents:External Memory Algorithms Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper) 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 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 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 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 A Fast Random Greedy Algorithm for the Component Commonality Problem Maximizing Job Completions Online, Includes bibliographical references and index