Algorithms

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 49 Recent progress in string algorithms
3. Altmetric Badge
   Chapter 50 Selection networks
4. Altmetric Badge
   Chapter 51 Computing edge-connectivity in multiple and capacitated graphs
5. Altmetric Badge
   Chapter 52 Efficient sequential and parallel algorithms for planar minimum cost flow
6. Altmetric Badge
   Chapter 53 Structural analyses on the complexity of inverting functions
7. Altmetric Badge
   Chapter 54 Oracles versus proof techniques that do not relativize
8. Altmetric Badge
   Chapter 55 20-Relative neighborhood graphs are Hamiltonian
9. Altmetric Badge
   Chapter 56 The K-Gabriel graphs and their applications
10. Altmetric Badge
    Chapter 57 Parallel algorithms for generating subsets and set partitions
11. Altmetric Badge
    Chapter 58 Parallel algorithms for linked list and beyond
12. Altmetric Badge
    Chapter 59 Local tournaments and proper circular arc graphs
13. Altmetric Badge
    Chapter 60 Fast algorithms for the dominating set problem on permutation graphs
14. Altmetric Badge
    Chapter 61 Two probabilistic results on merging
15. Altmetric Badge
    Chapter 62 Randomized broadcast in networks
16. Altmetric Badge
    Chapter 63 On the construction of abstract voronoi diagrams, II
17. Altmetric Badge
    Chapter 64 Searching in higher dimension
18. Altmetric Badge
    Chapter 65 Finding extrema with unary predicates
19. Altmetric Badge
    Chapter 66 Implicitly searching convolutions and computing depth of collision
20. Altmetric Badge
    Chapter 67 Characterization for a family of infinitely many irreducible Equally Spaced Polynomials
21. Altmetric Badge
    Chapter 68 Distributed algorithms for deciphering
22. Altmetric Badge
    Chapter 69 An efficient algorithm for optimal loop parallelization (extended abstract)
23. Altmetric Badge
    Chapter 70 Another view on the SSS* algorithm
24. Altmetric Badge
    Chapter 71 Algorithms from complexity theory: Polynomial-time operations for complex sets
25. Altmetric Badge
    Chapter 72 Complexity cores and hard problem instances
26. Altmetric Badge
    Chapter 73 Spatial point location and its applications
27. Altmetric Badge
    Chapter 74 Sublinear merging and natural merge sort
28. Altmetric Badge
    Chapter 75 Constructing strongly convex approximate hulls with inaccurate primitives
29. Altmetric Badge
    Chapter 76 Computing puiseux-series solutions to determinatal equations via combinatorial relaxation
30. Altmetric Badge
    Chapter 77 A tight lower bound on the size of planar permutation networks
31. Altmetric Badge
    Chapter 78 Simultaneous solution of families of problems
32. Altmetric Badge
    Chapter 79 Algorithms for projecting points to give the most uniform distribution with applications to hashing
33. Altmetric Badge
    Chapter 80 Topological sweeping in three dimensions
34. Altmetric Badge
    Chapter 81 Finding least-weight subsequences with fewer processors
35. Altmetric Badge
    Chapter 82 Derandomization by exploiting redundancy and mutual independence
36. Altmetric Badge
    Chapter 83 Planar separators and the Euclidean norm
37. Altmetric Badge
    Chapter 84 On the complexity of isometric embedding in the hypercube
38. Altmetric Badge
    Chapter 85 Distributed function evaluation in the presence of transmission faults
39. Altmetric Badge
    Chapter 86 Optimal linear broadcast
40. Altmetric Badge
    Chapter 87 Graph augmentation problems for a specified set of vertices
41. Altmetric Badge
    Chapter 88 A heuristic algorithm for the k -center problem with vertex weight
42. Altmetric Badge
    Chapter 89 Parallel convexity algorithms for digitized images on a linear array of processors
43. Altmetric Badge
    Chapter 90 Parallel algorithms for labeling image components
44. Altmetric Badge
    Chapter 91 A hyperplane Incidence problem with applications to counting distances
45. Altmetric Badge
    Chapter 92 Splitting a configuration in a simplex
46. Altmetric Badge
    Chapter 93 Weaving patterns of lines and line segments in space
47. Altmetric Badge
    Chapter 94 Efficient parallel algorithms for path problems in planar directed graphs
48. Altmetric Badge
    Chapter 95 Parallel algorithms for finding Steiner forests in planar graphs
49. Altmetric Badge
    Chapter 96 Optimally managing the history of an evolving forest