Algorithm Theory — SWAT '92

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Direct bulk-synchronous parallel algorithms
3. Altmetric Badge
   Chapter 2 Memory limited inductive inference machines
4. Altmetric Badge
   Chapter 3 Retrieval of scattered information by EREW, CREW and CRCW PRAMs
5. Altmetric Badge
   Chapter 4 On small depth threshold circuits
6. Altmetric Badge
   Chapter 5 An elementary approach to some analytic asymptotics
7. Altmetric Badge
   Chapter 6 An optimal parallel algorithm for computing a near-optimal order of matrix multiplications
8. Altmetric Badge
   Chapter 7 Generating sparse 2—spanners
9. Altmetric Badge
   Chapter 8 Low-diameter graph decomposition is in NC
10. Altmetric Badge
    Chapter 9 Parallel algorithm for cograph recognition with applications
11. Altmetric Badge
    Chapter 10 Parallel algorithms for all minimum link paths and link center problems
12. Altmetric Badge
    Chapter 11 Optimal multi-packet routing on the torus
13. Altmetric Badge
    Chapter 12 Parallel algorithms for priority queue operations
14. Altmetric Badge
    Chapter 13 Heap construction in the parallel comparison tree model
15. Altmetric Badge
    Chapter 14 Efficient rebalancing of chromatic search trees
16. Altmetric Badge
    Chapter 15 The complexity of scheduling problems with communication delays for trees
17. Altmetric Badge
    Chapter 16 The list update problem and the retrieval of sets
18. Altmetric Badge
    Chapter 17 Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
19. Altmetric Badge
    Chapter 18 Fractional cascading simplified
20. Altmetric Badge
    Chapter 19 Dynamic 2- and 3-connectivity on planar graphs
21. Altmetric Badge
    Chapter 20 Fully dynamic 2-edge-connectivity in planar graphs
22. Altmetric Badge
    Chapter 21 Non-interfering network flows
23. Altmetric Badge
    Chapter 22 Triangulating planar graphs while minimizing the maximum degree
24. Altmetric Badge
    Chapter 23 How to draw a series-parallel digraph
25. Altmetric Badge
    Chapter 24 Coloring random graphs
26. Altmetric Badge
    Chapter 25 Testing superperfection of k -trees
27. Altmetric Badge
    Chapter 26 Parametric problems on graphs of bounded tree-width
28. Altmetric Badge
    Chapter 27 Efficient two-dimensional searching
29. Altmetric Badge
    Chapter 28 Improvements on geometric pattern matching problems
30. Altmetric Badge
    Chapter 29 Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
31. Altmetric Badge
    Chapter 30 New results on linear programming and related problems
32. Altmetric Badge
    Chapter 31 Dynamic closest pairs — A probabilistic approach
33. Altmetric Badge
    Chapter 32 Two- and three- dimensional point location in rectangular subdivisions
34. Altmetric Badge
    Chapter 33 Decomposing the boundary of a nonconvex polyhedron
35. Altmetric Badge
    Chapter 34 Convex polygons made from few lines and convex decompositions of polyhedra
36. Altmetric Badge
    Chapter 35 Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
37. Altmetric Badge
    Chapter 36 Voronoi diagrams of moving points in higher dimensional spaces
38. Altmetric Badge
    Chapter 37 Sorting multisets stably in minimum space
39. Altmetric Badge
    Chapter 38 A framework for adaptive sorting