↓ Skip to main content

Foundations of Computation Theory

Overview of attention for book
Cover of 'Foundations of Computation Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 89 Experiments, powerdomains and fully abstract models for applicative multiprogramming
  3. Altmetric Badge
    Chapter 90 Deterministic dynamic logic of recursive programs is weaker than dynamic logic
  4. Altmetric Badge
    Chapter 91 Reversal-bounded and visit-bounded realtime computations
  5. Altmetric Badge
    Chapter 92 Input-driven languages are recognized in log n space
  6. Altmetric Badge
    Chapter 93 How to search in history
  7. Altmetric Badge
    Chapter 94 Comstructive matnkmatics as a programming logic I: Some principles of theory
  8. Altmetric Badge
    Chapter 95 The classification of problems which have fast parallel algorithms
  9. Altmetric Badge
    Chapter 96 A fair calculus of communicating systems
  10. Altmetric Badge
    Chapter 97 Two way finite state generators
  11. Altmetric Badge
    Chapter 98 A complete set of axioms for a theory of communicating sequential processes
  12. Altmetric Badge
    Chapter 99 The consensus problem in unreliable distributed systems (a brief survey)
  13. Altmetric Badge
    Chapter 100 Methods in the analysis of algorithms : Evaluations of a recursive partitioning process
  14. Altmetric Badge
    Chapter 101 Space and reversal complexity of probabilistic one-way turing machines
  15. Altmetric Badge
    Chapter 102 Pseudorandom number generation and space complexity
  16. Altmetric Badge
    Chapter 103 Recurring dominoes: Making the highly undecidable highly understandable (preliminary report)
  17. Altmetric Badge
    Chapter 104 Propositional dynamic logic of flowcharts
  18. Altmetric Badge
    Chapter 105 Fast triangulation of simple polygons
  19. Altmetric Badge
    Chapter 106 On containment problems for finite-turn languages
  20. Altmetric Badge
    Chapter 107 On languages generated by semigroups
  21. Altmetric Badge
    Chapter 108 Aspects of programs with finite modes
  22. Altmetric Badge
    Chapter 109 Estimating a probability using finite memory
  23. Altmetric Badge
    Chapter 110 The greedy and Delauney triangulations are not bad in the average case and minimum weight geometric triangulation of multi-connected polygons is NP-complete
  24. Altmetric Badge
    Chapter 111 Decision problems for exponential rings: The p-adic case
  25. Altmetric Badge
    Chapter 112 Functional behavior of nondeterministic programs
  26. Altmetric Badge
    Chapter 113 A single source shortest path algorithm for graphs with separators
  27. Altmetric Badge
    Chapter 114 Isomorphism testing and canonical forms for k-contractable graphs (A generalization of bounded valence and bounded genus)
  28. Altmetric Badge
    Chapter 115 Finding dominators
  29. Altmetric Badge
    Chapter 116 Characterizing composability of abstract implementations
  30. Altmetric Badge
    Chapter 117 Propositional logics of programs: New directions
  31. Altmetric Badge
    Chapter 118 A new probabilistic model for the study of algorithmic properties of random graph problems
  32. Altmetric Badge
    Chapter 119 On diagonalization methods and the structure of language classes
  33. Altmetric Badge
    Chapter 120 A new solution for the Byzantine generals problem
  34. Altmetric Badge
    Chapter 121 Modular decomposition of automata (survey)
  35. Altmetric Badge
    Chapter 122 A kernel language for algebraic specification and implementation extended abstract
  36. Altmetric Badge
    Chapter 123 A fast construction of disjoint paths in communication networks
  37. Altmetric Badge
    Chapter 124 A tight Ω(loglog n)-bound on the time for parallel Ram's to compute nondegenerated boolean functions
  38. Altmetric Badge
    Chapter 125 The identification of propositions and types in Martin-Löf's type theory: A programming example
  39. Altmetric Badge
    Chapter 126 Remarks on searching labyrinths by automata
  40. Altmetric Badge
    Chapter 127 Metrical and ordered properties of powerdomains
  41. Altmetric Badge
    Chapter 128 Economy of description for program schemes extended abstract
  42. Altmetric Badge
    Chapter 129 On approximate string matching
  43. Altmetric Badge
    Chapter 130 Deterministic context-free dynamic logic is more expressive than deterministic dynamic logic of regular programs
  44. Altmetric Badge
    Chapter 131 Foundations of Computation Theory
  45. Altmetric Badge
    Chapter 132 Reasoning with fairness constraints
Attention for Chapter 99: The consensus problem in unreliable distributed systems (a brief survey)
Altmetric Badge

Mentioned by

twitter
1 tweeter

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
78 Mendeley
citeulike
2 CiteULike
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
The consensus problem in unreliable distributed systems (a brief survey)
Chapter number 99
Book title
Foundations of Computation Theory
Published by
Springer, Berlin, Heidelberg, August 1983
DOI 10.1007/3-540-12689-9_99
Book ISBNs
978-3-54-012689-8, 978-3-54-038682-7
Authors

Michael J. Fischer

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 3 4%
Italy 1 1%
France 1 1%
United Kingdom 1 1%
China 1 1%
Portugal 1 1%
Unknown 70 90%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 27 35%
Researcher 14 18%
Student > Master 13 17%
Student > Bachelor 4 5%
Student > Doctoral Student 4 5%
Other 13 17%
Unknown 3 4%
Readers by discipline Count As %
Computer Science 56 72%
Engineering 8 10%
Business, Management and Accounting 2 3%
Agricultural and Biological Sciences 1 1%
Arts and Humanities 1 1%
Other 3 4%
Unknown 7 9%