Algorithms - ESA '98 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Bilardi, Gianfranco (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Italiano, Giuseppe F. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Pietracaprina, Andrea (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Pucci, Geppino (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
• Έκδοση: 1st ed. 1998.
• Σειρά: Lecture Notes in Computer Science, 1461
• Θέματα: Computers.; Algorithms.; Computer science-Mathematics.; Computer communication systems.; Data structures (Computer science).; Probabilities.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Computer Communication Networks.; Data Structures.; Probability Theory and Stochastic Processes.

Πίνακας περιεχομένων:

• Invited 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.