↓ Skip to main content
What is this page? Embed badge

Theoretical Computer Science 4th GI Conference

Overview of attention for book
Cover of 'Theoretical Computer Science 4th GI Conference'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Context-free sets of infinite words
  3. Altmetric Badge
    Chapter 2 New aspects of homomorphisms
  4. Altmetric Badge
    Chapter 3 Can partial correctness assertions specify programming language semantics?
  5. Altmetric Badge
    Chapter 4 An algebraic theory for synchronization
  6. Altmetric Badge
    Chapter 5 Storage modification machines
  7. Altmetric Badge
    Chapter 6 Negative results on counting
  8. Altmetric Badge
    Chapter 7 Strong non-deterministic context-free languages
  9. Altmetric Badge
    Chapter 8 Information content characterizations of complexity theoretic properties
  10. Altmetric Badge
    Chapter 9 Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
  11. Altmetric Badge
    Chapter 10 A new recursion induction principle
  12. Altmetric Badge
    Chapter 11 Finite-change automata
  13. Altmetric Badge
    Chapter 12 Move rules and trade-offs in the pebble game
  14. Altmetric Badge
    Chapter 13 Transition diagrams and strict deterministic grammars
  15. Altmetric Badge
    Chapter 14 Exact expressions for some randomness tests
  16. Altmetric Badge
    Chapter 15 On storage optimization for automatically generated compilers
  17. Altmetric Badge
    Chapter 16 On continuous completions
  18. Altmetric Badge
    Chapter 17 A new method to show lower bounds for polynomials which are hard to compute
  19. Altmetric Badge
    Chapter 18 On zerotesting-bounded multicounter machines
  20. Altmetric Badge
    Chapter 19 When are two effectively given domains identical?
  21. Altmetric Badge
    Chapter 20 Sur deux langages linéaires
  22. Altmetric Badge
    Chapter 21 An efficient on-line position tree construction algorithm
  23. Altmetric Badge
    Chapter 22 Sorting presorted files
  24. Altmetric Badge
    Chapter 23 Node-visit optimal 1 – 2 brother trees
  25. Altmetric Badge
    Chapter 24 A graph theoretic approach to determinism versus non-determinism
  26. Altmetric Badge
    Chapter 25 Une caracterisation de trois varietes de langages bien connues
  27. Altmetric Badge
    Chapter 26 Über eine minimale universelle Turing-Maschine
  28. Altmetric Badge
    Chapter 27 Sur les varietes de langages et de monoïdes
  29. Altmetric Badge
    Chapter 28 Automaten in planaren graphen
  30. Altmetric Badge
    Chapter 29 Theoreme de transversale rationnelle pour les automates a pile deterministes
  31. Altmetric Badge
    Chapter 30 On the additive complexity of polynomials and some new lower bounds
  32. Altmetric Badge
    Chapter 31 Remarks on the nonexistence of some covering grammars
  33. Altmetric Badge
    Chapter 32 Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme
Attention for Chapter 4: An algebraic theory for synchronization
Altmetric Badge

Readers on

mendeley
1 Mendeley
Summary
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.
Chapter title
An algebraic theory for synchronization
Chapter number 4
Book title
Theoretical Computer Science 4th GI Conference
Published in
Lecture notes in computer science, May 2005
DOI 10.1007/3-540-09118-1_4
Book ISBNs
978-3-54-009118-9, 978-3-54-035517-5
Authors

Milner, R., R. Milner

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%

This page is provided by Altmetric.