Skip to main content
SpringerLink
Log in

SWAT '88

1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings

  • Conference proceedings
  • © 1988

Overview

Editors:
  1. Rolf Karlsson
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Andrzej Lingas
    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 318)

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 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 (29 papers)

  1. Front Matter

    Download chapter PDF

  2. An implicit binomial queue with constant insertion time

    • Svante Carlsson, J. Ian Munro, Patricio V. Poblete
    Pages 1-13

  3. Implicit selection

    • Tony W. Lai, Derick Wood
    Pages 14-23

  4. An extrapolation on the interpolation search

    • Svante Carlsson, Christer Mattsson
    Pages 24-33

  5. Time parameter and arbitrary deunions in the set union problem

    • Heikki Mannila, Esko Ukkonen
    Pages 34-42

  6. Two new algorithms for constructing min-max heaps

    • Lars Draws, Patrik Eriksson, Erik Forslund, Leif Höglund, Sören Vallner, Thomas Strothotte
    Pages 43-50

  7. Extremal cost tree data structures

    • Derick Wood
    Pages 51-63

  8. Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques

    • Leonidas Guibas, Mark Overmars, Micha Sharir
    Pages 64-73

  9. Problems of posting sentries: Variations on the art gallery theorem

    • R. P. Krishnaswamy, C. E. Kim
    Pages 74-85

  10. A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons

    • Oliver Günther
    Pages 86-95

  11. On recognizing and characterizing visibility graphs of simple polygons

    • Subir Kumar Ghosh
    Pages 96-104

  12. Connectability problems

    • Mark H. Overmars
    Pages 105-112

  13. Two hybrid methods for collision resolution in open addressing hashing

    • Walter Cunto, Patricio V. Poblete
    Pages 113-119

  14. On an alternative sum useful in the analysis of some data structures

    • Wojciech Szpankowski
    Pages 120-128

  15. Bin-packing in 1.5 dimension

    • Sven-Olai Høyland
    Pages 129-137

  16. Applications of a symbolic perturbation scheme

    • Chee Yap
    Pages 138-138

  17. A fast parallel algorithm for computing all maximal cliques in a graph and the related problems

    • Elias Dahlhaus, Marek Karpinski
    Pages 139-144

  18. Parallel solution of sparse linear systems

    • John R. Gilbert, Hjálmtýr Hafsteinsson
    Pages 145-153

  19. A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors

    • Frank Dehne, Jörg-R. Sack, Ivan Stojmenović
    Pages 154-162

  20. Probabilistic log-space reductions and problems probabilistically hard for p

    • Lefteris M. Kirousis, Paul Spirakis
    Pages 163-175
Back to top

Keywords

About this book

The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.

Bibliographic Information

  • Book Title: SWAT '88

  • Book Subtitle: 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5-8, 1988. Proceedings

  • Editors: Rolf Karlsson, Andrzej Lingas

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-19487-8

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1988

  • Softcover ISBN: 978-3-540-19487-3Published: 22 June 1988

  • eBook ISBN: 978-3-540-39288-0Published: 05 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 264

  • Topics: Theory of Computation, Mathematics, general, Algorithm Analysis and Problem Complexity

Publish with us

Policies and ethics

Back to top

Search

Navigation