Algorithms and Complexity

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 55 Algorithms and data structures for control dependence and related compiler problems
3. Altmetric Badge
   Chapter 56 Embedding interconnection networks in grids via the Layered Cross Product
4. Altmetric Badge
   Chapter 57 Finding optimum k -vertex connected spanning subgraphs: Improved approximation algorithms for k =3, 4, 5
5. Altmetric Badge
   Chapter 58 The optimum cost chromatic partition problem
6. Altmetric Badge
   Chapter 59 Fault tolerant K-center problems
7. Altmetric Badge
   Chapter 60 R 1− tt SN (NP) distinguishes robust many-one and Turing completeness
8. Altmetric Badge
   Chapter 61 Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
9. Altmetric Badge
   Chapter 62 On the drift of short schedules
10. Altmetric Badge
    Chapter 63 On removing non-degeneracy assumptions in computational geometry
11. Altmetric Badge
    Chapter 64 Maintaining maxima under boundary updates
12. Altmetric Badge
    Chapter 65 An optimal algorithm for one-separation of a set of isothetic polygons
13. Altmetric Badge
    Chapter 66 Nice drawings for planar bipartite graphs
14. Altmetric Badge
    Chapter 67 Area requirement of Gabriel drawings (extended abstract)
15. Altmetric Badge
    Chapter 68 Design of reliable combinatorial algorithms using certificates
16. Altmetric Badge
    Chapter 69 An improved deterministic algorithm for generalized random sampling
17. Altmetric Badge
    Chapter 70 Polynomial time algorithms for some self-duality problems
18. Altmetric Badge
    Chapter 71 A note on updating suffix tree labels
19. Altmetric Badge
    Chapter 72 Relaxed balanced red-black trees
20. Altmetric Badge
    Chapter 73 The algorithmic complexity of chemical threshold testing
21. Altmetric Badge
    Chapter 74 A meticulous analysis of mergesort programs
22. Altmetric Badge
    Chapter 75 BSP-like external-memory computation
23. Altmetric Badge
    Chapter 76 Topological chaos for elementary cellular automata
24. Altmetric Badge
    Chapter 77 On the complexity of balanced Boolean functions
25. Altmetric Badge
    Chapter 78 On sets with easy certificates and the existence of one-way permutations
26. Altmetric Badge
    Chapter 79 Isomorphism for graphs of bounded distance width
27. Altmetric Badge
    Chapter 80 Hardness of approximating problems on cubic graphs
28. Altmetric Badge
    Chapter 81 Tree contractions and evolutionary trees