Foundations of Software Technology and Theoretical Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Recent Developments in the Theory of Arrangements of Surfaces
3. Altmetric Badge
   Chapter 2 Dynamic Compressed Hyperoctrees with Application to the N-body Problem
4. Altmetric Badge
   Chapter 3 Largest Empty Rectangle among a Point Set
5. Altmetric Badge
   Chapter 4 Renaming Is Necessary in Timed Regular Expressions
6. Altmetric Badge
   Chapter 5 Product Interval Automata: A Subclass of Timed Automata
7. Altmetric Badge
   Chapter 6 The Complexity of Rebalancing a Binary Search Tree
8. Altmetric Badge
   Chapter 7 Fast Allocation and Deallocation with an Improved Buddy System
9. Altmetric Badge
   Chapter 8 Optimal Bounds for Transformations of ω-Automata
10. Altmetric Badge
    Chapter 9 CTL + Is Exponentially More Succinct than CTL
11. Altmetric Badge
    Chapter 10 A Top-Down Look at a Secure Message
12. Altmetric Badge
    Chapter 11 Explaining Updates by Minimal Sums
13. Altmetric Badge
    Chapter 12 A Foundation for Hybrid Knowledge Bases
14. Altmetric Badge
    Chapter 13 Hoare Logic for Mutual Recursion and Local Variables
15. Altmetric Badge
    Chapter 14 Explicit Substitutions and Programming Languages
16. Altmetric Badge
    Chapter 15 Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings
17. Altmetric Badge
    Chapter 16 A Randomized Algorithm for Flow Shop Scheduling
18. Altmetric Badge
    Chapter 17 Synthesizing Distributed Transition Systems from Global Specifications
19. Altmetric Badge
    Chapter 18 Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
20. Altmetric Badge
    Chapter 19 Implicit Temporal Query Languages: Towards Completeness
21. Altmetric Badge
    Chapter 20 On the Undecidability of Some Sub-classical First-Order Logics
22. Altmetric Badge
    Chapter 21 How to Compute with DNA
23. Altmetric Badge
    Chapter 22 A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
24. Altmetric Badge
    Chapter 23 Protecting Facets in Layered Manufacturing
25. Altmetric Badge
    Chapter 24 The Receptive Distributed π-Calculus
26. Altmetric Badge
    Chapter 25 Series and Parallel Operations on Pomsets
27. Altmetric Badge
    Chapter 26 Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus
28. Altmetric Badge
    Chapter 27 Graph Isomorphism: Its Complexity and Algorithms
29. Altmetric Badge
    Chapter 28 Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables
30. Altmetric Badge
    Chapter 29 Lower Bounds for Linear Transformed OBDDs and FBDDs
31. Altmetric Badge
    Chapter 30 A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems
32. Altmetric Badge
    Chapter 31 Graded Modalities and Resource Bisimulation
33. Altmetric Badge
    Chapter 32 The Non-recursive Power of Erroneous Computation
34. Altmetric Badge
    Chapter 33 Analysis of Quantum Functions
35. Altmetric Badge
    Chapter 34 On Sets Growing Continuously
36. Altmetric Badge
    Chapter 35 Model Checking Knowledge and Time in Systems with Perfect Recall
37. Altmetric Badge
    Chapter 36 The Engineering of Some Bipartite Matching Programs