↓ 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 A Time Complexity Bound for Adaptive Mutual Exclusion
  3. Altmetric Badge
    Chapter 2 Quorum-Based Algorithms for Group Mutual Exclusion
  4. Altmetric Badge
    Chapter 3 An Effective Characterization of Computability in Anonymous Networks
  5. Altmetric Badge
    Chapter 4 Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
  6. Altmetric Badge
    Chapter 5 Optimal Unconditional Information Diffusion
  7. Altmetric Badge
    Chapter 6 Computation Slicing: Techniques and Theory
  8. Altmetric Badge
    Chapter 7 A Low-Latency Non-blocking Commit Service
  9. Altmetric Badge
    Chapter 8 Stable Leader Election
  10. Altmetric Badge
    Chapter 9 Adaptive Long-lived O ( k 2 )-Renaming with O ( k 2 ) Steps
  11. Altmetric Badge
    Chapter 10 A New Synchronous Lower Bound for Set Agreement
  12. Altmetric Badge
    Chapter 11 The Complexity of Synchronous Iterative Do-All with Crashes
  13. Altmetric Badge
    Chapter 12 Mobile Search for a Black Hole in an Anonymous Ring
  14. Altmetric Badge
    Chapter 13 Randomised Mutual Search for k > 2 Agents
  15. Altmetric Badge
    Chapter 14 Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks
  16. Altmetric Badge
    Chapter 15 Self Stabilizing Distributed Queuing
  17. Altmetric Badge
    Chapter 16 A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings
  18. Altmetric Badge
    Chapter 17 Randomized Finite-state Distributed Algorithms As Markov Chains
  19. Altmetric Badge
    Chapter 18 The Average Hop Count Measure For Virtual Path Layouts
  20. Altmetric Badge
    Chapter 19 Efficient Routing in Networks with Long Range Contacts
  21. Altmetric Badge
    Chapter 20 An Efficient Communication Strategy for Ad-hoc Mobile Networks
  22. Altmetric Badge
    Chapter 21 A Pragmatic Implementation of Non-blocking Linked-lists
  23. Altmetric Badge
    Chapter 22 Stabilizing Replicated Search Trees
  24. Altmetric Badge
    Chapter 23 Adding Networks
Attention for Chapter 21: A Pragmatic Implementation of Non-blocking Linked-lists
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (77th percentile)
  • Good Attention Score compared to outputs of the same age and source (69th percentile)

Mentioned by

twitter
1 X user
wikipedia
1 Wikipedia page

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
101 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
A Pragmatic Implementation of Non-blocking Linked-lists
Chapter number 21
Book title
Distributed Computing
Published in
Lecture notes in computer science, January 2001
DOI 10.1007/3-540-45414-4_21
Book ISBNs
978-3-54-042605-9, 978-3-54-045414-4
Authors

Timothy L. Harris, Harris, Timothy L.

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

Geographical breakdown

Country Count As %
United States 6 6%
United Kingdom 2 2%
Chile 1 <1%
Italy 1 <1%
Hungary 1 <1%
Sweden 1 <1%
Denmark 1 <1%
Canada 1 <1%
Unknown 87 86%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 37 37%
Student > Master 22 22%
Other 10 10%
Researcher 10 10%
Student > Bachelor 7 7%
Other 10 10%
Unknown 5 5%
Readers by discipline Count As %
Computer Science 88 87%
Engineering 3 3%
Mathematics 2 2%
Unknown 8 8%
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 01 December 2022.
All research outputs
#6,558,175
of 23,230,825 outputs
Outputs from Lecture notes in computer science
#2,116
of 8,155 outputs
Outputs of similar age
#21,616
of 115,267 outputs
Outputs of similar age from Lecture notes in computer science
#6
of 23 outputs
Altmetric has tracked 23,230,825 research outputs across all sources so far. This one has received more attention than most of these and is in the 70th percentile.
So far Altmetric has tracked 8,155 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 72% 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 115,267 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 77% of its contemporaries.
We're also able to compare this research output to 23 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 69% of its contemporaries.