↓ 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 On the Computational Complexity of MapReduce
  3. Altmetric Badge
    Chapter 2 Efficient Counting with Optimal Resilience
  4. Altmetric Badge
    Chapter 3 The Computational Power of Beeps
  5. Altmetric Badge
    Chapter 4 Byzantine Fireflies
  6. Altmetric Badge
    Chapter 5 Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability
  7. Altmetric Badge
    Chapter 6 Simulating a Shared Register in an Asynchronous System that Never Stops Changing
  8. Altmetric Badge
    Chapter 7 Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space
  9. Altmetric Badge
    Chapter 8 Anonymous Graph Exploration with Binoculars
  10. Altmetric Badge
    Chapter 9 Limit Behavior of the Multi-agent Rotor-Router System
  11. Altmetric Badge
    Chapter 10 Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution
  12. Altmetric Badge
    Chapter 11 SmartMerge: A New Approach to Reconfiguration for Atomic Storage
  13. Altmetric Badge
    Chapter 12 Towards Automatic Lock Removal for Scalable Synchronization
  14. Altmetric Badge
    Chapter 13 Inherent Limitations of Hybrid Transactional Memory
  15. Altmetric Badge
    Chapter 14 Why Non-blocking Operations Should be Selfish
  16. Altmetric Badge
    Chapter 15 Hybrid Transactional Memory Revisited
  17. Altmetric Badge
    Chapter 16 Grasping the Gap Between Blocking and Non-Blocking Transactional Memories
  18. Altmetric Badge
    Chapter 17 Fast Consensus for Voting on General Expander Graphs
  19. Altmetric Badge
    Chapter 18 Randomness vs. Time in Anonymous Networks
  20. Altmetric Badge
    Chapter 19 Fast Byzantine Leader Election in Dynamic Networks
  21. Altmetric Badge
    Chapter 20 Local Information in Influence Networks
  22. Altmetric Badge
    Chapter 21 Amalgamated Lock-Elision
  23. Altmetric Badge
    Chapter 22 Transactional Interference-Less Balanced Tree
  24. Altmetric Badge
    Chapter 23 Distributed Computing
  25. Altmetric Badge
    Chapter 24 A Constructive Approach for Proving Data Structures’ Linearizability
  26. Altmetric Badge
    Chapter 25 Modular Verification of Concurrency-Aware Linearizability
  27. Altmetric Badge
    Chapter 26 Transaction Chopping for Parallel Snapshot Isolation
  28. Altmetric Badge
    Chapter 27 Computing in Additive Networks with Bounded-Information Codes
  29. Altmetric Badge
    Chapter 28 Specifying Concurrent Problems: Beyond Linearizability and up to Tasks
  30. Altmetric Badge
    Chapter 29 From Geometric Semantics to Asynchronous Computability
  31. Altmetric Badge
    Chapter 30 On the Optimal Space Complexity of Consensus for Anonymous Processes
  32. Altmetric Badge
    Chapter 31 Compressing Communication in Distributed Protocols
  33. Altmetric Badge
    Chapter 32 Privacy-Conscious Information Diffusion in Social Networks
  34. Altmetric Badge
    Chapter 33 Fair Distributed Computation of Reactive Functions
  35. Altmetric Badge
    Chapter 34 Smoothed Analysis of Dynamic Networks
  36. Altmetric Badge
    Chapter 35 Fault Tolerant Reachability for Directed Graphs
  37. Altmetric Badge
    Chapter 36 Locally Optimal Load Balancing
  38. Altmetric Badge
    Chapter 37 Distributed Large Independent Sets in One Round on Bounded-Independence Graphs
  39. Altmetric Badge
    Chapter 38 Tight Bounds for MIS in Multichannel Radio Networks
  40. Altmetric Badge
    Chapter 39 Nonuniform SINR+Voroni Diagrams Are Effectively Uniform
  41. Altmetric Badge
    Chapter 40 Stable Leader Election in Population Protocols Requires Linear Time
  42. Altmetric Badge
    Chapter 41 Distributed Computing
  43. Altmetric Badge
    Chapter 42 Space-Optimal Counting in Population Protocols
Attention for Chapter 41: Distributed Computing
Altmetric Badge

Mentioned by

1 tweeter


1 Dimensions

Readers on

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
Distributed Computing
Chapter number 41
Book title
Distributed Computing
Published in
Lecture notes in computer science, September 2015
DOI 10.1007/978-3-662-48653-5_41
Book ISBNs
978-3-66-248652-8, 978-3-66-248653-5

Hillel Avni, Eliezer Levy, Avi Mendelson

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

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 1 10%
Unknown 9 90%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 2 20%
Researcher 2 20%
Student > Ph. D. Student 2 20%
Professor 1 10%
Student > Master 1 10%
Other 0 0%
Unknown 2 20%
Readers by discipline Count As %
Computer Science 5 50%
Engineering 3 30%
Unknown 2 20%

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 29 September 2016.
All research outputs
of 16,884,169 outputs
Outputs from Lecture notes in computer science
of 7,740 outputs
Outputs of similar age
of 273,646 outputs
Outputs of similar age from Lecture notes in computer science
of 162 outputs
Altmetric has tracked 16,884,169 research outputs across all sources so far. This one is in the 1st percentile – i.e., 1% of other outputs scored the same or lower than it.
So far Altmetric has tracked 7,740 research outputs from this source. They receive a mean Attention Score of 4.6. This one is in the 1st percentile – i.e., 1% 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 273,646 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 162 others from the same source and published within six weeks on either side of this one. This one is in the 1st percentile – i.e., 1% of its contemporaries scored the same or lower than it.