↓ Skip to main content

Theoretical Computer Science

Overview of attention for book
Cover of 'Theoretical Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Computability and Non-computability Issues in Amorphous Computing
  3. Altmetric Badge
    Chapter 2 Static Single Information Form for Abstract Compilation
  4. Altmetric Badge
    Chapter 3 Input-Driven Stack Automata
  5. Altmetric Badge
    Chapter 4 Probabilistic Inference and Monadic Second Order Logic
  6. Altmetric Badge
    Chapter 5 Cinderella versus the Wicked Stepmother
  7. Altmetric Badge
    Chapter 6 Worst- and Average-Case Privacy Breaches in Randomization Mechanisms
  8. Altmetric Badge
    Chapter 7 Weak Bisimulations for Coalgebras over Ordered Functors
  9. Altmetric Badge
    Chapter 8 A Context-Free Linear Ordering with an Undecidable First-Order Theory
  10. Altmetric Badge
    Chapter 9 Open Bisimulation for Quantum Processes
  11. Altmetric Badge
    Chapter 10 A Modular LTS for Open Reactive Systems
  12. Altmetric Badge
    Chapter 11 Unidirectional Channel Systems Can Be Tested
  13. Altmetric Badge
    Chapter 12 On Properties and State Complexity of Deterministic State-Partition Automata
  14. Altmetric Badge
    Chapter 13 On Union-Free and Deterministic Union-Free Languages
  15. Altmetric Badge
    Chapter 14 A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
  16. Altmetric Badge
    Chapter 15 Formal Verification of Distributed Algorithms
  17. Altmetric Badge
    Chapter 16 A Temporal Logic for Multi-threaded Programs
  18. Altmetric Badge
    Chapter 17 The Algorithmic Complexity of k-Domatic Partition of Graphs
  19. Altmetric Badge
    Chapter 18 Unique Parallel Decomposition in Branching and Weak Bisimulation Semantics
  20. Altmetric Badge
    Chapter 19 Modal Interface Automata
  21. Altmetric Badge
    Chapter 20 Proofs as Executions
  22. Altmetric Badge
    Chapter 21 Efficient Algorithms for the max k -vertex cover Problem
  23. Altmetric Badge
    Chapter 22 A Model Theoretic Proof of Completeness of an Axiomatization of Monadic Second-Order Logic on Infinite Words
  24. Altmetric Badge
    Chapter 23 Compositional Abstraction Techniques for Probabilistic Automata
  25. Altmetric Badge
    Chapter 24 Broadcast Abstraction in a Stochastic Calculus for Mobile Networks
  26. Altmetric Badge
    Chapter 25 An Intersection Type System for Deterministic Pushdown Automata
  27. Altmetric Badge
    Chapter 26 An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus
  28. Altmetric Badge
    Chapter 27 Erratum: Probabilistic Inference and Monadic Second Order Logic
  29. Altmetric Badge
    Chapter 28 Erratum: Cinderella versus the Wicked Stepmother
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
wikipedia
3 Wikipedia pages

Readers on

mendeley
5 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Theoretical Computer Science
Published by
Springer, Berlin, Heidelberg, January 2012
DOI 10.1007/978-3-642-33475-7
ISBNs
978-3-64-233474-0, 978-3-64-233475-7
Authors

Baeten, Jos C. M, Ball, Tom, Boer, Frank S

Editors

Jos C. M. Baeten, Tom Ball, Frank S. de Boer

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 5 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 20%
Unknown 4 80%
Readers by discipline Count As %
Mathematics 1 20%
Unknown 4 80%