Skip to main content
SpringerLink
Log in

Algorithms - ESA '98

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

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Gianfranco Bilardi

    1. Dipartimento di Elettronica e Informatica, Università di Padova, Padova, Italy
      Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, Chicago, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giuseppe F. Italiano

    1. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, Venezia Mestre, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Andrea Pietracaprina

    1. Dipartimento di Matematica Pura e Applicata, Università di Padova, Padova, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Geppino Pucci

    1. Dipartimento di Elettronica e Informatica, Università di Padova, Padova, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1461)

Included in the following conference series:

Conference proceedings info: ESA 1998.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (42 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Invited Lectures

    1. External Memory Algorithms

      • Jeffrey Scott Vitter
      Pages 1-25

    2. Design and Analysis of Dynamic Processes: A Stochastic Approach (Invited Paper)

      • Eli Upfal
      Pages 26-34

  3. Data Structures

    1. Car-Pooling as a Data Structuring Device: The Soft Heap

      • Bernard Chazelle
      Pages 35-42

    2. Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property

      • Phil Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
      Pages 43-54

    3. Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures

      • Enrico Nardelli, Guido Proietti, Peter Widmayer
      Pages 55-66

  4. Strings and Biology

    1. Augmenting Suffix Trees, with Applications

      • Yossi Matias, S. Muthukrishnan, Süleyman Cenk Sahinalp, Jacob Ziv
      Pages 67-78

    2. Longest Common Subsequence from Fragments via Sparse Dynamic Programming

      • Brenda S. Baker, Raffaele Giancarlo
      Pages 79-90

    3. Computing the Edit-Distance Between Unrooted Ordered Trees

      • Philip N. Klein
      Pages 91-102

    4. Analogs and Duals of the MAST Problem for Sequences and Trees

      • Michael Fellows, Michael Hallett, Chantal Korostensky, Ulrike Stege
      Pages 103-114

  6. Geometry

    1. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time

      • Matthias Fischer, Tamás Lukovszki, Martin Ziegler
      Pages 163-174

    2. A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)

      • Fabrizio d’Amore, Paolo G. Franciosa, Giuseppe Liotta
      Pages 175-186

    3. Positioning Guards at Fixed Height Above a Terrain — An Optimum Inapproximability Result

      • Stephan Eidenbenz, Christoph Stamm, Peter Widmayer
      Pages 187-198

    4. Two-Center Problems for a Convex Polygon (Extended Abstract)

      • Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa
      Pages 199-210

    5. Constructing Binary Space Partitions for Orthogonal Rectangles in Practice

      • T. M. Murali, Pankaj K. Agarwal, Jeffrey Scott Vitter
      Pages 211-222

  7. Randomized and On-Line Algorithms

    1. A Fast Random Greedy Algorithm for the Component Commonality Problem

      • Ravi Kannan, Andreas Nolte
      Pages 223-234
Back to top

Other volumes

  1. Algorithms — ESA’ 98

Keywords

Editors and Affiliations

  • Dipartimento di Elettronica e Informatica, Università di Padova, Padova, Italy

    Gianfranco Bilardi, Geppino Pucci

  • Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, Chicago, USA

    Gianfranco Bilardi

  • Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, Venezia Mestre, Italy

    Giuseppe F. Italiano

  • Dipartimento di Matematica Pura e Applicata, Università di Padova, Padova, Italy

    Andrea Pietracaprina

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation