Algorithms — ESA’ 98

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 External Memory Algorithms
3. Altmetric Badge
   Chapter 2 Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper)
4. Altmetric Badge
   Chapter 3 Car-Pooling as a Data Structuring Device: The Soft Heap
5. Altmetric Badge
   Chapter 4 Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
6. Altmetric Badge
   Chapter 5 Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
7. Altmetric Badge
   Chapter 6 Augmenting Suffix Trees, with Applications
8. Altmetric Badge
   Chapter 7 Longest Common Subsequence from Fragments via Sparse Dynamic Programming
9. Altmetric Badge
   Chapter 8 Computing the Edit-Distance Between Unrooted Ordered Trees
10. Altmetric Badge
    Chapter 9 Analogs and Duals of the MAST Problem for Sequences and Trees
11. Altmetric Badge
    Chapter 10 Complexity Estimates Depending on Condition and Round-Off Error
12. Altmetric Badge
    Chapter 11 Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting
13. Altmetric Badge
    Chapter 12 Fast Algorithms for Linear Algebra Modulo N
14. Altmetric Badge
    Chapter 13 A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers
15. Altmetric Badge
    Chapter 14 Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
16. Altmetric Badge
    Chapter 15 A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
17. Altmetric Badge
    Chapter 16 Positioning Guards at Fixed Height Above a Terrain — An Optimum Inapproximability Result
18. Altmetric Badge
    Chapter 17 Two-Center Problems for a Convex Polygon (Extended Abstract)
19. Altmetric Badge
    Chapter 18 Constructing Binary Space Partitions for Orthogonal Rectangles in Practice
20. Altmetric Badge
    Chapter 19 A Fast Random Greedy Algorithm for the Component Commonality Problem
21. Altmetric Badge
    Chapter 20 Maximizing Job Completions Online
22. Altmetric Badge
    Chapter 21 A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
23. Altmetric Badge
    Chapter 22 On Nonblocking Properties of the Beneš Network
24. Altmetric Badge
    Chapter 23 Adaptability and the Usefulness of Hints (Extended Abstract)
25. Altmetric Badge
    Chapter 24 Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract)
26. Altmetric Badge
    Chapter 25 New Bounds for Oblivious Mesh Routing
27. Altmetric Badge
    Chapter 26 Evaluating Server-Assisted Cache Replacement in the Web
28. Altmetric Badge
    Chapter 27 Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
29. Altmetric Badge
    Chapter 28 A Functional Approach to External Graph Algorithms
30. Altmetric Badge
    Chapter 29 Minimal Triangulations for Graphs with “Few” Minimal Separators
31. Altmetric Badge
    Chapter 30 Finding an Optimal Path without Growing the Tree
32. Altmetric Badge
    Chapter 31 An Experimental Study of Dynamic Algorithms for Directed Graphs
33. Altmetric Badge
    Chapter 32 Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme
34. Altmetric Badge
    Chapter 33 Δ -Stepping : A Parallel Single Source Shortest Path Algorithm
35. Altmetric Badge
    Chapter 34 Improved Deterministic Parallel Padded Sorting
36. Altmetric Badge
    Chapter 35 Analyzing an Infinite Parallel Job Allocation Process
37. Altmetric Badge
    Chapter 36 Nearest Neighbor Load Balancing on Graphs
38. Altmetric Badge
    Chapter 37 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
39. Altmetric Badge
    Chapter 38 Moving-Target TSP and Related Problems
40. Altmetric Badge
    Chapter 39 Fitting Points on the Real Line and Its Application to RH Mapping
41. Altmetric Badge
    Chapter 40 Approximate Coloring of Uniform Hypergraphs (Extended Abstract)
42. Altmetric Badge
    Chapter 41 Techniques for Scheduling with Rejection
43. Altmetric Badge
    Chapter 42 Computer-Aided Way to Prove Theorems in Scheduling