Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Ambiguity and Complementation in Recognizable Two-dimensional Languages
3. Altmetric Badge
   Chapter 2 Algorithmic Game Theory: Some Greatest Hits and Future Directions
4. Altmetric Badge
   Chapter 3 Synchronizing Road Coloring
5. Altmetric Badge
   Chapter 4 Leader Election in Anonymous Rings: Franklin Goes Probabilistic
6. Altmetric Badge
   Chapter 5 Inverse Problems Have Inverse Complexity
7. Altmetric Badge
   Chapter 6 Literal Shuffle of Compressed Words
8. Altmetric Badge
   Chapter 7 Reconstructing words from a fixed palindromic length sequence
9. Altmetric Badge
   Chapter 8 The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks
10. Altmetric Badge
    Chapter 9 Partitioning Random Graphs with General Degree Distributions
11. Altmetric Badge
    Chapter 10 On the Longest Common Factor Problem
12. Altmetric Badge
    Chapter 11 Stable Dynamics of Sand Automata
13. Altmetric Badge
    Chapter 12 On tractability of Cops and Robbers game
14. Altmetric Badge
    Chapter 13 Computability of Tilings
15. Altmetric Badge
    Chapter 14 A Classification of Degenerate Loop Agreement
16. Altmetric Badge
    Chapter 15 On the expressive power of univariate equations over sets of natural numbers
17. Altmetric Badge
    Chapter 16 Collisions and their Catenations: Ultimately Periodic Tilings of the Plane
18. Altmetric Badge
    Chapter 17 Cache-sensitive Memory Layout for Binary Trees
19. Altmetric Badge
    Chapter 18 From Processes to ODEs by Chemistry
20. Altmetric Badge
    Chapter 19 Differential Linear Logic and Processes
21. Altmetric Badge
    Chapter 20 Solving Monotone Polynomial Equations
22. Altmetric Badge
    Chapter 21 Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras
23. Altmetric Badge
    Chapter 22 Finite Equational Bases for Fragments of CCS with Restriction and Relabelling
24. Altmetric Badge
    Chapter 23 μ-calculus Pushdown Module Checking with Imperfect State Information
25. Altmetric Badge
    Chapter 24 From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures
26. Altmetric Badge
    Chapter 25 On Traits and Types in a Java-like Setting
27. Altmetric Badge
    Chapter 26 Canonical Sequent Proofs via Multi-Focusing
28. Altmetric Badge
    Chapter 27 Universal Coinductive Characterisations of Process Semantics
29. Altmetric Badge
    Chapter 28 Static and dynamic typing for the termination of mobile processes
30. Altmetric Badge
    Chapter 29 Regular n -ary Queries in Trees and Variable Independence
31. Altmetric Badge
    Chapter 30 Hamiltonicity of automatic graphs
32. Altmetric Badge
    Chapter 31 Marking the chops: an unambiguous temporal logic
33. Altmetric Badge
    Chapter 32 On Boundedness in Depth in the π-Calculus
34. Altmetric Badge
    Chapter 33 A Unified View of Tree Automata and Term Schematisations
35. Altmetric Badge
    Chapter 34 Deconstructing behavioural theories of mobility
36. Altmetric Badge
    Chapter 35 Adequacy of Compositional Translations for Observational Semantics
37. Altmetric Badge
    Chapter 36 The Surprising Robustness of (Closed) Timed Automata against Clock-Drift