Algorithms - ESA '98

Invited Lectures
- External Memory Algorithms Jeffrey S. Vitter
- Design and Analysis of Dynamic Processes: A Stochastic Approach Eli Upfal
- Data Structures Car-Pooling as a Data Structuring Device: The Soft Heap Bernard Chazelle
- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property Wojciech Rytter
- Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures Enrico Nardelli, Guido Proietti, Peter Widmayer
- Strings and Biology Augmenting Suffix Trees, with Applications Yossi Matias, S. Muthukrishnan, Sueleyman C. Sahinalp, Jacob Ziv
- Longest Common Subsequence from Fragments via Sparse Dynamic Programming Brenda S. Baker, Raffaele Giancarlo
- Computing the Edit-Distance Between Unrooted Ordered Trees Philip N. Klein
- Analogs and Duals of the MAST Problem for Sequences and Trees Michael Fellows, Michael Hallett, Chantal Korostensky, Ulrike Stege
- Numerical Algorithms Complexity Estimates Depending on Condition and Round-Off Error Felipe Cucker, Steve Smale
- Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting J. Maurice Rojas
- Fast Algorithms for Linear Algebra Modulo N Arne Storjohann, Thom Mulders
- A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers Johannes Bloemer
- Geometry Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time Matthias Fischer, Tamas Lukovszki, Martin Ziegler
- A Robust Region Approach to the Computation of Geometric Graphs Fabrizio d'Amore, Paolo G. Franciosa, Giuseppe Liotta
- Positioning Guards at Fixed Height above a Terrain -- An Optimum Inapproximability Result Stephan Eidenbenz, Christoph Stamm, Peter Widmayer
- Two-Center Problems for a Convex Polygon Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa
- Constructing Binary Space Partitions for Orthogonal Rectangles in Practice T.M. Murali, Pankaj K. Agarwal, Jeffrey S. Vitter
-