Lecture Notes in Computer Science

6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings

By: Gianfranco Bilardi (Editor), Giuseppe F. Italiano (Editor), Andrea Pietracaprina (Editor)

Write A Review

Paperback | 29 July 1998

At a Glance

Paperback
536 Pages

Dimensions(cm)
24.13 x 15.88 x 3.18

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 6th Annual European Symposium on Algorithms, ESA'97, held in Venice, Italy, in August 1998.The 40 revised full papers presented together with two invited contributions were carefully reviewed and selected from a total of 131 submissions. The book is divided into sections on data structures, strings and biology, numerical algorithms, geometry, randomized and online algorithms, parallel and distributed algorithms, graph algorithms, and optimization.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Programming & Software Development Algorithms & Data Structures Computer Networking & Communications Computer Science Mathematical Theory of Computation Graphical & Digital Media Applications 3D Graphics & Modelling Databases Data Capture & Analysis Computer Hardware

Network Hardware Mathematics Probability & Statistics Applied Mathematics Stochastics Artificial Intelligence

External Memory Algorithms	p. 1
Design and Analysis of Dynamic Processes: A Stochastic Approach	p. 26
Car-Pooling as a Data Structuring Device: The Soft Heap	p. 35
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property	p. 43
Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures	p. 55
Augmenting Suffix Trees, with Applications	p. 67
Longest Common Subsequence from Fragments via Sparse Dynamic Programming	p. 79
Computing the Edit-Distance Between Unrooted Ordered Trees	p. 91
Analogs and Duals of the MAST Problem for Sequences and Trees	p. 103
Complexity Estimates Depending on Condition and Round-Off Error	p. 115
Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting	p. 127
Fast Algorithms for Linear Algebra Modulo N	p. 139
A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers	p. 151
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time	p. 163
A Robust Region Approach to the Computation of Geometric Graphs	p. 175
Positioning Guards at Fixed Height above a Terrain - An Optimum Inapproximability Result	p. 187
Two-Center Problems for a Convex Polygon	p. 199
Constructing Binary Space Partitions for Orthogonal Rectangles in Practice	p. 211
A Fast Random Greedy Algorithm for the Component Commonality Problem	p. 223
Maximizing Job Completions Online	p. 235
A Randomized Algorithm for Two Servers on the Line	p. 247
On Nonblocking Properties of the Benes Network	p. 259
Adaptability and the Usefulness of Hints	p. 271
Fault-Tolerant Broadcasting in Radio Networks	p. 283
New Bounds for Oblivious Mesh Routing	p. 295
Evaluating Server-Assisted Cache Replacement in the Web	p. 307
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights	p. 320
A Functional Approach to External Graph Algorithms	p. 332
Minimal Triangulations for Graphs with "Few" Minimal Separators	p. 344
Finding an Optimal Path without Growing the Tree	p. 356
An Experimental Study of Dynamic Algorithms for Directed Graphs	p. 368
Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-known Theme	p. 381
[Delta]-Stepping : A Parallel Single Source Shortest Path Algorithm	p. 393
Improved Deterministic Parallel Padded Sorting	p. 405
Analyzing an Infinite Parallel Job Allocation Process	p. 417
Nearest Neighbor Load Balancing on Graphs	p. 429
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves	p. 441
Moving-Target TSP and Related Problems	p. 453
Fitting Points on the Real Line and Its Application to RH Mapping	p. 465
Approximate Coloring of Uniform Hypergraphs	p. 477
Techniques for Scheduling with Rejection	p. 490
Computer-Aided Way to Prove Theorems in Scheduling	p. 502
Author Index	p. 515
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Stochastics

Markov Chain Monte Carlo

Stochastic Simulation for Bayesian Inference

Markov Chain Monte Carlo

Stochastic Simulation for Bayesian Inference

Stochastic Control in Energy, Environmental and Resource Management Applications

Emerging Methodologies and Applications in Modelling, Identification and Control

Introduction to Stochastic Processes

2nd Edition

Backward Stochastic Volterra Integral Equations

Probability Theory and Stochastic Modelling

Logistic Regression

Bridging Theory and Practice

Stochastic Navier-Stokes Equations on Spheres and Spherical Shells

Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series

Copula Models for Dependent Competing Risks

Theory and applications in economics, engineering and medicine

Occupancy Estimation and Modeling

Inferring Patterns and Dynamics of Species Occurrence

Introduction To Stochastic Calculus With Applications (Third Edition)

Introduction to Probability

2nd edition

Understanding Markov Chains

Examples and Applications

Mathematics of Epidemics on Networks

From Exact to Approximate Models

Information Theory, Probability and Statistical Learning

A Festschrift in Honor of Andrew Barron

From Classical Analysis to Analysis on Fractals

A Tribute to Robert Strichartz, Volume 2

Optimal Control in Random Environments

Pontryagin Maximum Principle with Environment-dependent Jumps and Mean-Field Games with Common Poissonian Noise

Models for Longitudinal Data with Applications to Early Warning Systems

Workshops of the PRIN Project, Perugia, Italy, 19 September 2024, 11 September 2025 and 23 January 2026

Analysis and Geometry of Random Fields

Springer INdAM Series

Approximations to Probabilistic Characteristics of Stochastic Differential Equations

Lecture Notes in Mathematics

Branching Processes and Related Fields

Lecture Notes in Statistics

Applied Stochastic Modeling

Synthesis Lectures on Mathematics & Statistics

Mathematical Structures I—Stochastic and Analytic Structures with Applications

Exploring the World of Mathematical Structures Workshop, Vasteras, Sweden, May 14-16, 2024

Data-Based Mechanistic Modelling, Forecasting and Control

The Art and Craft

Measure and Integration

An Introductory Path Toward Functional Analysis and Probability

This product is categorised by