↓ 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
Attention for Chapter 8: Bounded Version Vectors
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
7 Dimensions

Readers on

mendeley
10 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
Bounded Version Vectors
Chapter number 8
Book title
Distributed Computing
Published in
Lecture notes in computer science, October 2004
DOI 10.1007/978-3-540-30186-8_8
Book ISBNs
978-3-54-023306-0, 978-3-54-030186-8
Authors

José Bacelar Almeida, Paulo Sérgio Almeida, Carlos Baquero, José Bacelar Almeida, Paulo Sérgio Almeida, Almeida, José Bacelar, Almeida, Paulo Sérgio, Baquero, Carlos

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 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 2 20%
France 1 10%
Unknown 7 70%

Demographic breakdown

Readers by professional status Count As %
Other 3 30%
Student > Ph. D. Student 3 30%
Student > Master 2 20%
Student > Bachelor 1 10%
Researcher 1 10%
Other 0 0%
Readers by discipline Count As %
Computer Science 9 90%
Physics and Astronomy 1 10%
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 20 July 2013.
All research outputs
#18,341,711
of 22,714,025 outputs
Outputs from Lecture notes in computer science
#6,005
of 8,124 outputs
Outputs of similar age
#58,380
of 61,413 outputs
Outputs of similar age from Lecture notes in computer science
#27
of 32 outputs
Altmetric has tracked 22,714,025 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 14th percentile – i.e., 14% 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 61,413 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 2nd percentile – i.e., 2% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 32 others from the same source and published within six weeks on either side of this one. This one is in the 9th percentile – i.e., 9% of its contemporaries scored the same or lower than it.