↓ 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 The Synchronous Condition-Based Consensus Hierarchy
  3. Altmetric Badge
    Chapter 2 Synchronous Condition-Based Consensus Adapting to Input-Vector Legality
  4. Altmetric Badge
    Chapter 3 Group-Solvability
  5. Altmetric Badge
    Chapter 4 The Notion of Veto Number and the Respective Power of $\Diamond {\cal P}$ and $\Diamond {\cal S}$ to Solve One-Shot Agreement Problems
  6. Altmetric Badge
    Chapter 5 The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
  7. Altmetric Badge
    Chapter 6 Local-Spin Group Mutual Exclusion Algorithms
  8. Altmetric Badge
    Chapter 7 On Quorum Systems for Group Resources with Bounded Capacity
  9. Altmetric Badge
    Chapter 8 Bounded Version Vectors
  10. Altmetric Badge
    Chapter 9 An Optimistic Approach to Lock-Free FIFO Queues
  11. Altmetric Badge
    Chapter 10 A Single-Enqueuer Wait-Free Queue Implementation
  12. Altmetric Badge
    Chapter 11 Practical Lock-Free and Wait-Free LL/SC/VL Implementations Using 64-Bit CAS
  13. Altmetric Badge
    Chapter 12 Efficient Adaptive Collect Using Randomization
  14. Altmetric Badge
    Chapter 13 Nonblocking Concurrent Data Structures with Condition Synchronization
  15. Altmetric Badge
    Chapter 14 Dynamic Memory ABP Work-Stealing
  16. Altmetric Badge
    Chapter 15 Coupling and Self-stabilization
  17. Altmetric Badge
    Chapter 16 Optimal Randomized Self-stabilizing Mutual Exclusion on Synchronous Rings
  18. Altmetric Badge
    Chapter 17 Virtual Mobile Nodes for Mobile Ad Hoc Networks
  19. Altmetric Badge
    Chapter 18 Contention-Free MAC Protocols for Wireless Sensor Networks
  20. Altmetric Badge
    Chapter 19 Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
  21. Altmetric Badge
    Chapter 20 A Local Algorithm for Ad Hoc Majority Voting via Charge Fusion
  22. Altmetric Badge
    Chapter 21 Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
  23. Altmetric Badge
    Chapter 22 Routing with Improved Communication-Space Trade-Off
  24. Altmetric Badge
    Chapter 23 Active and Concurrent Topology Maintenance
  25. Altmetric Badge
    Chapter 24 Distributed Weighted Matching
  26. Altmetric Badge
    Chapter 25 Exploiting Content Localities for Efficient Search in P2P Systems
  27. Altmetric Badge
    Chapter 26 Compact Routing Schemes for Bounded Tree-Length Graphs and for k -Chordal Graphs
  28. Altmetric Badge
    Chapter 27 Towards a Theory of Consistency Primitives
  29. Altmetric Badge
    Chapter 28 Fault-Tolerant Storage in a Dynamic Environment
  30. Altmetric Badge
    Chapter 29 Non-skipping Timestamps for Byzantine Data Storage Systems
  31. Altmetric Badge
    Chapter 30 Efficient Verification for Provably Secure Storage and Secret Sharing in Systems Where Half the Servers Are Faulty
  32. Altmetric Badge
    Chapter 31 Optimal Dispersal of Certificate Chains
  33. Altmetric Badge
    Chapter 32 On Byzantine Agreement over (2,3)-Uniform Hypergraphs
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (74th percentile)
  • Above-average Attention Score compared to outputs of the same age and source (58th percentile)

Mentioned by

twitter
1 X user
wikipedia
2 Wikipedia pages

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 Computing
Published by
Lecture notes in computer science, January 2004
DOI 10.1007/b101206
ISBNs
978-3-54-023306-0, 978-3-54-030186-8
Editors

Guerraoui, Rachid

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 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 %
Unknown 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 4. 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 25 February 2024.
All research outputs
#8,262,193
of 26,017,215 outputs
Outputs from Lecture notes in computer science
#2,390
of 8,229 outputs
Outputs of similar age
#36,335
of 147,517 outputs
Outputs of similar age from Lecture notes in computer science
#43
of 115 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. This one has received more attention than most of these and is in the 67th percentile.
So far Altmetric has tracked 8,229 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.3. This one has gotten more attention than average, scoring higher than 69% of its peers.
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 147,517 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 74% of its contemporaries.
We're also able to compare this research output to 115 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 58% of its contemporaries.