↓ Skip to main content
What is this page? Embed badge

Distributed Algorithms

Overview of attention for book
Cover of 'Distributed Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Self-stabilizing ring orientation
  3. Altmetric Badge
    Chapter 2 Memory-efficient self stabilizing protocols for general networks
  4. Altmetric Badge
    Chapter 3 On the computational power needed to elect a leader
  5. Altmetric Badge
    Chapter 4 Spanning tree construction for nameless networks
  6. Altmetric Badge
    Chapter 5 A linear fault-tolerant naming algorithm
  7. Altmetric Badge
    Chapter 6 Distributed data structures: A complexity-oriented view
  8. Altmetric Badge
    Chapter 7 An improved algorithm to detect communication deadlocks in distributed systems
  9. Altmetric Badge
    Chapter 8 On the average performance of synchronized programs in distributed networks
  10. Altmetric Badge
    Chapter 9 Distributed algorithms for reconstructing MST after topology change
  11. Altmetric Badge
    Chapter 10 Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
  12. Altmetric Badge
    Chapter 11 Stepwise development of a distributed load balancing algorithm
  13. Altmetric Badge
    Chapter 12 Greedy packet scheduling
  14. Altmetric Badge
    Chapter 13 Optimal computation of global sensitive functions in fast networks
  15. Altmetric Badge
    Chapter 14 Efficient mechanism for fairness and deadlock-avoidance in high-speed networks
  16. Altmetric Badge
    Chapter 15 Strong verifiable secret sharing extended abstract
  17. Altmetric Badge
    Chapter 16 Weak consistency and pessimistic replica control
  18. Altmetric Badge
    Chapter 17 Localized-access protocols for replicated databases
  19. Altmetric Badge
    Chapter 18 Weighted voting for operation dependent management of replicated data
  20. Altmetric Badge
    Chapter 19 Wakeup under read/write atomicity
  21. Altmetric Badge
    Chapter 20 Time and message efficient reliable broadcasts
  22. Altmetric Badge
    Chapter 21 Early-stopping distributed bidding and applications
  23. Altmetric Badge
    Chapter 22 Fast consensus in networks of bounded degree
  24. Altmetric Badge
    Chapter 23 Common knowledge and consistent simultaneous coordination
  25. Altmetric Badge
    Chapter 24 Agreement on the group membership in synchronous distributed systems
  26. Altmetric Badge
    Chapter 25 Tight bounds on the round complexity of distributed 1-solvable tasks
  27. Altmetric Badge
    Chapter 26 A time-randomness tradeoff for communication complexity
  28. Altmetric Badge
    Chapter 27 Bounds on the costs of register implementations
  29. Altmetric Badge
    Chapter 28 A bounded first-in, first-enabled solution to the l-exclusion problem
Attention for Chapter 3: On the computational power needed to elect a leader
Altmetric Badge

Mentioned by

twitter
1 X user
Summary X
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
On the computational power needed to elect a leader
Chapter number 3
Book title
Distributed Algorithms
Published in
Lecture notes in computer science, January 1991
DOI 10.1007/3-540-54099-7_3
Book ISBNs
978-3-54-054099-1, 978-3-54-047405-0
Authors

Alon Itai

View on publisher site
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.
 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 19 May 2012.
All research outputs
#18,306,425
of 22,665,794 outputs
Outputs from Lecture notes in computer science
#6,005
of 8,123 outputs
Outputs of similar age
#57,520
of 59,297 outputs
Outputs of similar age from Lecture notes in computer science
#9
of 10 outputs
Altmetric has tracked 22,665,794 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,123 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 59,297 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 10 others from the same source and published within six weeks on either side of this one.

This page is provided by Altmetric.