↓ 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 Exploring gafni's reduction land: from Ω k o Wait-Free Adaptive (2p - ⌈ p / k ⌉)-Renaming Via k-Set Agreemen
  3. Altmetric Badge
    Chapter 2 Renaming in Message Passing Systems with Byzantine Failures
  4. Altmetric Badge
    Chapter 3 Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
  5. Altmetric Badge
    Chapter 4 Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
  6. Altmetric Badge
    Chapter 5 Fast Computation by Population Protocols with a Leader
  7. Altmetric Badge
    Chapter 6 On Self-stabilizing Search Trees
  8. Altmetric Badge
    Chapter 7 Efficient Dynamic Aggregation
  9. Altmetric Badge
    Chapter 8 Groupings and Pairings in Anonymous Networks
  10. Altmetric Badge
    Chapter 9 A New Proof of the GHS Minimum Spanning Tree Algorithm
  11. Altmetric Badge
    Chapter 10 A Knowledge-Based Analysis of Global Function Computation
  12. Altmetric Badge
    Chapter 11 Checking a Multithreaded Algorithm with  +  CAL
  13. Altmetric Badge
    Chapter 12 Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture
  14. Altmetric Badge
    Chapter 13 Conflict Detection and Validation Strategies for Software Transactional Memory
  15. Altmetric Badge
    Chapter 14 Transactional Locking II
  16. Altmetric Badge
    Chapter 15 Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects
  17. Altmetric Badge
    Chapter 16 One-Step Consensus Solvability
  18. Altmetric Badge
    Chapter 17 Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
  19. Altmetric Badge
    Chapter 18 On Consistency of Encrypted Files
  20. Altmetric Badge
    Chapter 19 Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data
  21. Altmetric Badge
    Chapter 20 A Lazy Snapshot Algorithm with Eager Validation
  22. Altmetric Badge
    Chapter 21 Bounded Wait-Free f -Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients
  23. Altmetric Badge
    Chapter 22 Time and Communication Efficient Consensus for Crash Failures
  24. Altmetric Badge
    Chapter 23 Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
  25. Altmetric Badge
    Chapter 24 Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes
  26. Altmetric Badge
    Chapter 25 A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
  27. Altmetric Badge
    Chapter 26 On Randomized Broadcasting in Power Law Networks
  28. Altmetric Badge
    Chapter 27 Distributed Approximation Algorithms in Unit-Disk Graphs
  29. Altmetric Badge
    Chapter 28 The Weakest Failure Detectors to Boost Obstruction-Freedom
  30. Altmetric Badge
    Chapter 29 Fully-Adaptive Algorithms for Long-Lived Renaming
  31. Altmetric Badge
    Chapter 30 Constructing Shared Objects That Are Both Robust and High-Throughput
  32. Altmetric Badge
    Chapter 31 Byzantine and Multi-writer K-Quorums
  33. Altmetric Badge
    Chapter 32 On Minimizing the Number of ADMs in a General Topology Optical Network
  34. Altmetric Badge
    Chapter 33 Robust Network Supercomputing with Malicious Processes
  35. Altmetric Badge
    Chapter 34 Distributed Resource Allocation in Stream Processing Systems
  36. Altmetric Badge
    Chapter 35 Low-latency Atomic Broadcast in the presence of contention
  37. Altmetric Badge
    Chapter 36 Oblivious Gradient Clock Synchronization
  38. Altmetric Badge
    Chapter 37 Brief Announcement: Abortable and Query-Abortable Objects
  39. Altmetric Badge
    Chapter 38 Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers
  40. Altmetric Badge
    Chapter 39 Brief Announcement: Convergence Analysis of Scalable Gossip Protocols
  41. Altmetric Badge
    Chapter 40 Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules
  42. Altmetric Badge
    Chapter 41 Brief Announcement: Many Slices Are Better Than One
  43. Altmetric Badge
    Chapter 42 Brief Announcement: On Augmented Graph Navigability
  44. Altmetric Badge
    Chapter 43 Brief Announcement: Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems
  45. Altmetric Badge
    Chapter 44 Brief Announcement: Optimistic Algorithms for Partial Database Replication
  46. Altmetric Badge
    Chapter 45 Brief Announcement: Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays
  47. Altmetric Badge
    Chapter 46 Brief Announcement: Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance
  48. Altmetric Badge
    Chapter 47 Brief Announcement Monitoring of Linear Distributed Computations
  49. Altmetric Badge
    Chapter 48 Brief Announcement: Communication-Optimal Implementation of Failure Detector Class $\diamond{\mathcal P}$
  50. Altmetric Badge
    Chapter 49 Brief Announcement: Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks
  51. Altmetric Badge
    Chapter 50 Provably Unbreakable Hyper-encryption Using Distributed Systems
  52. Altmetric Badge
    Chapter 51 Time, Clocks, and the Ordering of My Ideas About Distributed Systems
  53. Altmetric Badge
    Chapter 52 My Early Days in Distributed Computing Theory: 1979–1982
  54. Altmetric Badge
    Chapter 53 Panel on the Contributions of the DISC Community to Distributed Computing: A Historical Perspective
  55. Altmetric Badge
    Chapter 54 DISC at Its 20th Anniversary:Past, Present and Future
  56. Altmetric Badge
    Chapter 55 DISC at Its 20th Anniversary: Past, Present and Future
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
twitter
1 X user
patent
1 patent
wikipedia
1 Wikipedia page
q&a
1 Q&A thread

Citations

dimensions_citation
9 Dimensions

Readers on

mendeley
23 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.
Title
Distributed Computing
Published by
Springer Science & Business Media, September 2006
DOI 10.1007/11864219
ISBNs
978-3-54-044624-8, 978-3-54-044627-9
Editors

Dolev, Shlomi, Dolev, Shlomi

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

Geographical breakdown

Country Count As %
South Africa 1 4%
Unknown 22 96%

Demographic breakdown

Readers by professional status Count As %
Student > Master 6 26%
Researcher 6 26%
Student > Ph. D. Student 5 22%
Student > Bachelor 2 9%
Other 1 4%
Other 3 13%
Readers by discipline Count As %
Agricultural and Biological Sciences 10 43%
Engineering 4 17%
Environmental Science 3 13%
Earth and Planetary Sciences 2 9%
Unspecified 1 4%
Other 3 13%