SWAT 88

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 An implicit binomial queue with constant insertion time
3. Altmetric Badge
   Chapter 2 Implicit selection
4. Altmetric Badge
   Chapter 3 An extrapolation on the interpolation search
5. Altmetric Badge
   Chapter 4 Time parameter and arbitrary deunions in the set union problem
6. Altmetric Badge
   Chapter 5 Two new algorithms for constructing min-max heaps
7. Altmetric Badge
   Chapter 6 Extremal cost tree data structures
8. Altmetric Badge
   Chapter 7 Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques
9. Altmetric Badge
   Chapter 8 Problems of posting sentries: Variations on the art gallery theorem
10. Altmetric Badge
    Chapter 9 A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons
11. Altmetric Badge
    Chapter 10 On recognizing and characterizing visibility graphs of simple polygons
12. Altmetric Badge
    Chapter 11 Connectability problems
13. Altmetric Badge
    Chapter 12 Two hybrid methods for collision resolution in open addressing hashing
14. Altmetric Badge
    Chapter 13 On an alternative sum useful in the analysis of some data structures
15. Altmetric Badge
    Chapter 14 Bin-packing in 1.5 dimension
16. Altmetric Badge
    Chapter 15 Applications of a symbolic perturbation scheme
17. Altmetric Badge
    Chapter 16 A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
18. Altmetric Badge
    Chapter 17 Parallel solution of sparse linear systems
19. Altmetric Badge
    Chapter 18 A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors
20. Altmetric Badge
    Chapter 19 Probabilistic log-space reductions and problems probabilistically hard for p
21. Altmetric Badge
    Chapter 20 Searching with uncertainty extended abstract
22. Altmetric Badge
    Chapter 21 An optimal expected-time parallel algorithm for Voronoi diagrams
23. Altmetric Badge
    Chapter 22 Generating binary trees by transpositions
24. Altmetric Badge
    Chapter 23 Approximating the complete Euclidean graph
25. Altmetric Badge
    Chapter 24 Upper and lower bounds for the dictionary problem
26. Altmetric Badge
    Chapter 25 Linear algorithms for graph separation problems
27. Altmetric Badge
    Chapter 26 Polynomial algorithms for graph isomorphism and chromatic index on partial k -trees
28. Altmetric Badge
    Chapter 27 NC algorithms for computing the number of perfect matchings in K 3,3 -free graphs and related problems
29. Altmetric Badge
    Chapter 28 Independent covers in outerplanar graphs
30. Altmetric Badge
    Chapter 29 Tight lower bounds for Shellsort