↓ 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 6: Distributed data structures: A complexity-oriented view
Altmetric Badge

Readers on

mendeley
2 Mendeley
Summary
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 data structures: A complexity-oriented view
Chapter number 6
Book title
Distributed Algorithms
Published by
Springer, Berlin, Heidelberg, September 1990
DOI 10.1007/3-540-54099-7_6
Book ISBNs
978-3-54-054099-1, 978-3-54-047405-0
Authors

David Peleg

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Germany 1 50%
Unknown 1 50%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Student > Doctoral Student 1 50%
Readers by discipline Count As %
Computer Science 2 100%

This page is provided by Altmetric.