Skip to main content
SpringerLink
Log in
Book cover

Algorithms - ESA '95

Third Annual European Symposium, Corfu, Greece, September, 25 - 27, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Paul Spirakis
    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 979)

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

Access this book

Log in via an institution
Softcover Book USD 109.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 (43 papers)

  1. Front Matter

    Download chapter PDF

  2. On mixed connectivity certificates

    • Shimon Even, Gene Itkis, Sergio Rajsbaum
    Pages 1-16

  3. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model

    • Armin Bäumker, Wolfgang Dittrich, Friedhelm Meyer auf der Heide
    Pages 17-30

  4. Optimal parallel shortest paths in small treewidth digraphs

    • Shiva Chaudhuri, Christos D. Zaroliagis
    Pages 31-45

  5. Shared memory simulations with triple-logarithmic delay

    • Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Pages 46-59

  6. Implementing shared memory on multi-dimensional meshes and on the fat-tree

    • Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    Pages 60-74

  7. Beyond the worst-case bisection bound: Fast sorting and ranking on meshes

    • Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
    Pages 75-88

  8. Fast deterministic simulation of computations on faulty parallel machines

    • Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
    Pages 89-101

  9. Average circuit depth and average communication complexity

    • Bruno Codenotti, Peter Gemmell, Janos Simon
    Pages 102-112

  10. Packing trees

    • Joseph Gil, Alon Itai
    Pages 113-127

  11. Sometimes travelling is easy: The master tour problem

    • Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger
    Pages 128-141

  12. Interval graphs with side (and size) constraints

    • Itsik Pe'er, Ron Shamir
    Pages 142-154

  13. Maximum skew-symmetric flows

    • Andrew V. Goldberg, Alexander V. Karzanov
    Pages 155-170

  14. Certificates and fast algorithms for biconnectivity in fully-dynamic graphs

    • Monika R. Henzinger, Han La Poutré
    Pages 171-184

  15. On the all-pairs shortest path algorithm of Moffat and Takaoka

    • Kurt Mehlhorn, Volker Priebe
    Pages 185-198

  16. Fully Dynamic Transitive Closure in plane dags with one source and one sink

    • Thore Husfeldt
    Pages 199-212

  17. Planarity for clustered graphs

    • Qing-Wen Feng, Robert F. Cohen, Peter Eades
    Pages 213-226

  18. A geometric approach to betweenness

    • Benny Chor, Madhu Sudan
    Pages 227-237

  19. Efficient computation of the geodesic Voronoi diagram of points in a simple polygon

    • Evanthia Papadopoulou, D. T. Lee
    Pages 238-251

  20. Linear size binary space partitions for fat objects

    • Mark de Berg
    Pages 252-263
Back to top

Keywords

About this book

This book consitutes the proceedings of the Third Annual European Symposium on Algorithms, ESA '95, held in Corfu, Greece in September 1995.
The volume presents 42 full revised papers selected during a careful refereeing process from a total of 119 submissions; in addition, there is a prominent keynote address. This year, the scope has been further expanded to new areas of computational endeavour in science; the book covers many aspects of algorithms research and application ranging from combinatorial mathematics to hardware design.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation