Foundations of Software Technology and Theoretical Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 109 Efficient resolution of singularities of plane curves
3. Altmetric Badge
   Chapter 110 On the interactive complexity of graph reliability
4. Altmetric Badge
   Chapter 111 Matching upper and lower bounds for simulations of several tapes on one multidimensional tape
5. Altmetric Badge
   Chapter 112 The complexity of computing over quasigroups
6. Altmetric Badge
   Chapter 113 Non-commutative computation, depth reduction, and skew circuits (extended abstract)
7. Altmetric Badge
   Chapter 114 Inductive definitions and type theory an introduction (preliminary version)
8. Altmetric Badge
   Chapter 115 Interpreter verification for a functional language
9. Altmetric Badge
   Chapter 116 An epistemic foundation for logic programming with uncertainty
10. Altmetric Badge
    Chapter 117 On typed calculi with a merge operator
11. Altmetric Badge
    Chapter 118 Incremental algorithms for the single-source shortest path problem
12. Altmetric Badge
    Chapter 119 An O(n) algorithm for realizing degree sequences
13. Altmetric Badge
    Chapter 120 Coloring semi-random graphs in polynomial expected time
14. Altmetric Badge
    Chapter 121 Finite-state strategies in regular infinite games
15. Altmetric Badge
    Chapter 122 Location of the largest empty rectangle among arbitrary obstacles
16. Altmetric Badge
    Chapter 123 Efficient parallel and linear time sequential split decomposition (extended abstract)
17. Altmetric Badge
    Chapter 124 Algorithms for convex visibility problems
18. Altmetric Badge
    Chapter 125 Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems
19. Altmetric Badge
    Chapter 126 Localities and failures (extended summary)
20. Altmetric Badge
    Chapter 127 Priority and abstraction in process algebra
21. Altmetric Badge
    Chapter 128 On the computational power of operators in ICSP with fairness
22. Altmetric Badge
    Chapter 129 Decidability of timed language-inclusion for networks of real-time communicating sequential processes
23. Altmetric Badge
    Chapter 130 My favorite ten complexity theorems of the past decade
24. Altmetric Badge
    Chapter 131 Solving a unification problem under constrained substitutions using tree automata
25. Altmetric Badge
    Chapter 132 Automata-driven efficient subterm unification
26. Altmetric Badge
    Chapter 133 Randomized approximation algorithms in combinatorial optimization
27. Altmetric Badge
    Chapter 134 A limited-backtrack greedy schema for approximation algorithms
28. Altmetric Badge
    Chapter 135 On approximation scheme preserving reductibility and its applications
29. Altmetric Badge
    Chapter 136 Approximation schemes using L-reductions
30. Altmetric Badge
    Chapter 137 An explanation of splaying
31. Altmetric Badge
    Chapter 138 Proving non-reachability by modulo-place-invariants
32. Altmetric Badge
    Chapter 139 Soundness and completeness of UNITY logic
33. Altmetric Badge
    Chapter 140 Efficient algorithms for the transformation between different types of binary decision diagrams
34. Altmetric Badge
    Chapter 141 Extending the limits of sequentially phased reasoning
35. Altmetric Badge
    Chapter 142 Foundations for faster external sorting
36. Altmetric Badge
    Chapter 143 Branching rules for satisfiability
37. Altmetric Badge
    Chapter 144 Using linear arithmetic procedure for generating induction schemes