↓ 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 27 Random leaders and random spanning trees
  3. Altmetric Badge
    Chapter 28 Fault-tolerant critical section management in asynchronous networks
  4. Altmetric Badge
    Chapter 29 Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
  5. Altmetric Badge
    Chapter 30 Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm
  6. Altmetric Badge
    Chapter 31 Combinatorics and geometry of consistent cuts : Application to concurrency theory
  7. Altmetric Badge
    Chapter 32 Distributed fairness algorithms for local area networks with concurrent transmissions
  8. Altmetric Badge
    Chapter 33 An efficient reliable ring protocol
  9. Altmetric Badge
    Chapter 34 An efficient solution to the drinking philosophers problem and its extensions
  10. Altmetric Badge
    Chapter 35 Highly concurrent logically synchronous multicast
  11. Altmetric Badge
    Chapter 36 Reliable broadcast in synchronous and asynchronous environments (preliminary version)
  12. Altmetric Badge
    Chapter 37 Observing global states of asynchronous distributed applications
  13. Altmetric Badge
    Chapter 38 Building a global time on parallel machines
  14. Altmetric Badge
    Chapter 39 Functional dependencies of variables in wait-free programs
  15. Altmetric Badge
    Chapter 40 Two strategies for solving the vertex cover problem on a transputer network
  16. Altmetric Badge
    Chapter 41 Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
  17. Altmetric Badge
    Chapter 42 Simple and efficient election algorithms for anonymous networks
  18. Altmetric Badge
    Chapter 43 A distributed solution for detecting deadlock in distributed nested transaction systems
  19. Altmetric Badge
    Chapter 44 Distributed deadlock detection and resolution with probes
  20. Altmetric Badge
    Chapter 45 A new algorithm to implement causal ordering
  21. Altmetric Badge
    Chapter 46 Symmetry breaking in asynchronous rings with o(n) messages
  22. Altmetric Badge
    Chapter 47 Designing distributed algorithms by means of formal sequentially phased reasoning
  23. Altmetric Badge
    Chapter 48 Possibility and impossibility results in a shared memory environment
  24. Altmetric Badge
    Chapter 49 Communication heuristics in distributed combinatorial search algorithms
  25. Altmetric Badge
    Chapter 50 The role of inhibition in asynchronous consistent-cut protocols
  26. Altmetric Badge
    Chapter 51 How to construct an atomic variable (extended abstract)
  27. Altmetric Badge
    Chapter 52 Electing a leader when processor identity numbers are not distinct (extended abstract)
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

patent
1 patent

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
36 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-51687-5
ISBNs
978-3-54-051687-3, 978-3-54-046750-2
Editors

Bermond, Jean-Claude, Raynal, Michel

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 36 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 6%
Lecturer 1 3%
Unspecified 1 3%
Unknown 32 89%
Readers by discipline Count As %
Unspecified 1 3%
Computer Science 1 3%
Social Sciences 1 3%
Materials Science 1 3%
Unknown 32 89%