Book Volume 318 1988


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


ISBN: 978-3-540-19487-3 (Print) 978-3-540-39288-0 (Online)

Table of contents (29 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-13

    An implicit binomial queue with constant insertion time

  3. Chapter

    Pages 14-23

    Implicit selection

  4. Chapter

    Pages 24-33

    An extrapolation on the interpolation search

  5. Chapter

    Pages 34-42

    Time parameter and arbitrary deunions in the set union problem

  6. Chapter

    Pages 43-50

    Two new algorithms for constructing min-max heaps

  7. Chapter

    Pages 51-63

    Extremal cost tree data structures

  8. Chapter

    Pages 64-73

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

  9. Chapter

    Pages 74-85

    Problems of posting sentries: Variations on the art gallery theorem

  10. Chapter

    Pages 86-95

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

  11. Chapter

    Pages 96-104

    On recognizing and characterizing visibility graphs of simple polygons

  12. Chapter

    Pages 105-112

    Connectability problems

  13. Chapter

    Pages 113-119

    Two hybrid methods for collision resolution in open addressing hashing

  14. Chapter

    Pages 120-128

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

  15. Chapter

    Pages 129-137

    Bin-packing in 1.5 dimension

  16. Chapter

    Pages 138-138

    Applications of a symbolic perturbation scheme

  17. Chapter

    Pages 139-144

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

  18. Chapter

    Pages 145-153

    Parallel solution of sparse linear systems

  19. Chapter

    Pages 154-162

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

  20. Chapter

    Pages 163-175

    Probabilistic log-space reductions and problems probabilistically hard for p

  21. Chapter

    Pages 176-189

    Searching with uncertainty extended abstract

previous Page of 2