↓ Skip to main content

Distributed Algorithms

Overview of attention for book
Cover of 'Distributed Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 23 Efficient wait-free implementation of a concurrent priority queue
  3. Altmetric Badge
    Chapter 24 Binary snapshots
  4. Altmetric Badge
    Chapter 25 Linear-time snapshot protocols for unbalanced systems
  5. Altmetric Badge
    Chapter 26 Towards a necessary and sufficient condition for wait-free synchronization (Extended Abstract)
  6. Altmetric Badge
    Chapter 27 Efficient algorithms for checking the atomicity of a run of read and write operations
  7. Altmetric Badge
    Chapter 28 Benign failure models for shared memory
  8. Altmetric Badge
    Chapter 29 Generalized agreement between concurrent fail-stop processes
  9. Altmetric Badge
    Chapter 30 Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract)
  10. Altmetric Badge
    Chapter 31 Asynchronous epoch management in replicated databases
  11. Altmetric Badge
    Chapter 32 Crash resilient communication in dynamic networks
  12. Altmetric Badge
    Chapter 33 Distributed job scheduling using snapshots
  13. Altmetric Badge
    Chapter 34 Optimal time self stabilization in dynamic systems
  14. Altmetric Badge
    Chapter 35 Tolerating transient and permanent failures (extended abstract)
  15. Altmetric Badge
    Chapter 36 Quick atomic broadcast
  16. Altmetric Badge
    Chapter 37 Time bounds for decision problems in the presence of timing uncertainty and failures
  17. Altmetric Badge
    Chapter 38 Boolean Routing
  18. Altmetric Badge
    Chapter 39 Notes on sorting and counting networks (extended abstract)
  19. Altmetric Badge
    Chapter 40 A simple, efficient algorithm for maximum finding on rings
  20. Altmetric Badge
    Chapter 41 Wang tilings and distributed orientation on anonymous torus networks (extended abstract)
  21. Altmetric Badge
    Chapter 42 Fairness of N-party synchronization and its implementation in a distributed environment
  22. Altmetric Badge
    Chapter 43 Programming distributed reactive systems: A strong and weak synchronous coupling
  23. Altmetric Badge
    Chapter 44 Using message semantics to reduce rollback in the time warp mechanism
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 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
Distributed Algorithms
Published by
Springer Berlin Heidelberg, January 2006
DOI 10.1007/3-540-57271-6
ISBNs
978-3-54-057271-8, 978-3-54-048029-7
Editors

Schiper, André

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 %
Student > Master 1 100%
Readers by discipline Count As %
Engineering 1 100%