↓ Skip to main content

Distributed Computing

Overview of attention for book
Cover of 'Distributed Computing'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks
  3. Altmetric Badge
    Chapter 2 Securing the Net: Challenges, Failures and Directions
  4. Altmetric Badge
    Chapter 3 Coterie Availability in Sites
  5. Altmetric Badge
    Chapter 4 Keeping Denial-of-Service Attackers in the Dark
  6. Altmetric Badge
    Chapter 5 On Conspiracies and Hyperfairness in Distributed Computing
  7. Altmetric Badge
    Chapter 6 On the Availability of Non-strict Quorum Systems
  8. Altmetric Badge
    Chapter 7 Musical Benches
  9. Altmetric Badge
    Chapter 8 Obstruction-Free Algorithms Can Be Practically Wait-Free
  10. Altmetric Badge
    Chapter 9 Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System
  11. Altmetric Badge
    Chapter 10 Non-blocking Hashtables with Open Addressing
  12. Altmetric Badge
    Chapter 11 Computing with Reads and Writes in the Absence of Step Contention
  13. Altmetric Badge
    Chapter 12 Restricted Stack Implementations
  14. Altmetric Badge
    Chapter 13 Proving Atomicity: An Assertional Approach
  15. Altmetric Badge
    Chapter 14 Time and Space Lower Bounds for Implementations Using k -CAS
  16. Altmetric Badge
    Chapter 15 (Almost) All Objects Are Universal in Message Passing Systems
  17. Altmetric Badge
    Chapter 16 Ω Meets Paxos: Leader Election and Stability Without Eventual Timely Links
  18. Altmetric Badge
    Chapter 17 Plausible Clocks with Bounded Inaccuracy
  19. Altmetric Badge
    Chapter 18 Causing Communication Closure: Safe Program Composition with Non-FIFO Channels
  20. Altmetric Badge
    Chapter 19 What Can Be Implemented Anonymously?
  21. Altmetric Badge
    Chapter 20 Waking Up Anonymous Ad Hoc Radio Networks
  22. Altmetric Badge
    Chapter 21 Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
  23. Altmetric Badge
    Chapter 22 Distributed Computing with Imperfect Randomness
  24. Altmetric Badge
    Chapter 23 Polymorphic Contention Management
  25. Altmetric Badge
    Chapter 24 Distributed Transactional Memory for Metric-Space Networks
  26. Altmetric Badge
    Chapter 25 Distributed Computing
  27. Altmetric Badge
    Chapter 26 Adaptive Software Transactional Memory
  28. Altmetric Badge
    Chapter 27 Optimistic Generic Broadcast
  29. Altmetric Badge
    Chapter 28 Space and Step Complexity Efficient Adaptive Collect
  30. Altmetric Badge
    Chapter 29 Observing Locally Self-stabilization in a Probabilistic Way
  31. Altmetric Badge
    Chapter 30 Asymptotically Optimal Solutions for Small World Graphs
  32. Altmetric Badge
    Chapter 31 Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time ,
  33. Altmetric Badge
    Chapter 32 Compact Routing for Graphs Excluding a Fixed Minor
  34. Altmetric Badge
    Chapter 33 General Compact Labeling Schemes for Dynamic Trees
  35. Altmetric Badge
    Chapter 34 The Dynamic And-Or Quorum System
  36. Altmetric Badge
    Chapter 35 Byzantine Clients Rendered Harmless
  37. Altmetric Badge
    Chapter 36 Reliably Executing Tasks in the Presence of Malicious Processors
  38. Altmetric Badge
    Chapter 37 Obstruction-Free Step Complexity: Lock-Free DCAS as an Example
  39. Altmetric Badge
    Chapter 38 Communication-Efficient Implementation of Failure Detector Classes $\diamondsuit\mathcal{Q}$ and $\diamondsuit\mathcal{P}$
  40. Altmetric Badge
    Chapter 39 Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
  41. Altmetric Badge
    Chapter 40 Agreement Among Unacquainted Byzantine Generals
  42. Altmetric Badge
    Chapter 41 Subscription Propagation and Content-Based Routing with Delivery Guarantees
  43. Altmetric Badge
    Chapter 42 Asynchronous Verifiable Information Dispersal
  44. Altmetric Badge
    Chapter 43 Towards a Theory of Self-organization
  45. Altmetric Badge
    Chapter 44 Timing Games and Shared Memory
  46. Altmetric Badge
    Chapter 45 A Lightweight Group Mutual k -Exclusion Algorithm Using Bi- k -Arbiters
  47. Altmetric Badge
    Chapter 46 Could any Graph be Turned into a Small-World?
  48. Altmetric Badge
    Chapter 47 Papillon: Greedy Routing in Rings
  49. Altmetric Badge
    Chapter 48 An Efficient Long-Lived Adaptive Collect Algorithm
Attention for Chapter 25: Distributed Computing
Altmetric Badge

Mentioned by

twitter
1 X user
facebook
1 Facebook page

Citations

dimensions_citation
2 Dimensions

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.
Chapter title
Distributed Computing
Chapter number 25
Book title
Distributed Computing
Published in
Lecture notes in computer science, September 2005
DOI 10.1007/11561927_25
Book ISBNs
978-3-54-029163-3, 978-3-54-032075-3
Authors

Pierre Fraigniaud, Dahlia Malkhi, Doug Terry, Malkhi, Dahlia, Terry, Doug

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
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 %
United States 1 20%
Canada 1 20%
Unknown 3 60%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 40%
Student > Bachelor 1 20%
Student > Doctoral Student 1 20%
Student > Master 1 20%
Readers by discipline Count As %
Computer Science 5 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 15 August 2016.
All research outputs
#17,812,370
of 22,882,389 outputs
Outputs from Lecture notes in computer science
#5,934
of 8,129 outputs
Outputs of similar age
#55,504
of 59,172 outputs
Outputs of similar age from Lecture notes in computer science
#42
of 52 outputs
Altmetric has tracked 22,882,389 research outputs across all sources so far. This one is in the 19th percentile – i.e., 19% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,129 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 26th percentile – i.e., 26% of its peers scored the same or lower than it.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 59,172 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 5th percentile – i.e., 5% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 52 others from the same source and published within six weeks on either side of this one. This one is in the 19th percentile – i.e., 19% of its contemporaries scored the same or lower than it.