Coverart for item
The Resource Algorithms--ESA '98 : 6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings, Gianfranco Bilardi [and others], (eds.)

Algorithms--ESA '98 : 6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings, Gianfranco Bilardi [and others], (eds.)

Label
Algorithms--ESA '98 : 6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings
Title
Algorithms--ESA '98
Title remainder
6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings
Statement of responsibility
Gianfranco Bilardi [and others], (eds.)
Creator
Contributor
Subject
Genre
Language
eng
Summary
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
Member of
Action
digitized
Cataloging source
OCLCE
Dewey number
004/.01/5118
Illustrations
illustrations
Index
index present
LC call number
QA76.9.A43
LC item number
E83 1998
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1998
http://bibfra.me/vocab/lite/meetingName
ESA (Symposium)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Bilardi, G.
Series statement
Lecture notes in computer science,
Series volume
1461
http://library.link/vocab/subjectName
  • Computer algorithms
  • Algorithmes
  • Computer algorithms
  • Algoritmen
  • Algoritmos e estruturas de dados
  • Algorithmes
Label
Algorithms--ESA '98 : 6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings, Gianfranco Bilardi [and others], (eds.)
Instantiates
Publication
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
681754265
Dimensions
unknown
Extent
1 online resource (xii, 513 pages)
Form of item
online
Isbn
9783540685302
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)681754265
System details
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Label
Algorithms--ESA '98 : 6th annual European symposium, Venice, Italy, August 24-26, 1998 : proceedings, Gianfranco Bilardi [and others], (eds.)
Publication
Antecedent source
file reproduced from original
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
black and white
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Control code
681754265
Dimensions
unknown
Extent
1 online resource (xii, 513 pages)
Form of item
online
Isbn
9783540685302
Level of compression
  • lossless
  • lossy
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
illustrations.
Reformatting quality
  • preservation
  • access
Reproduction note
Electronic reproduction.
Specific material designation
remote
System control number
(OCoLC)681754265
System details
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
Processing Feedback ...