↓ 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 Routing and Scheduling with Incomplete Information
  3. Altmetric Badge
    Chapter 2 Time-Efficient Broadcasting in Radio Networks
  4. Altmetric Badge
    Chapter 3 A Subjective Visit to Selected Topics in Distributed Computing
  5. Altmetric Badge
    Chapter 4 Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
  6. Altmetric Badge
    Chapter 5 A Simple Population Protocol for Fast Robust Approximate Majority
  7. Altmetric Badge
    Chapter 6 A Denial-of-Service Resistant DHT
  8. Altmetric Badge
    Chapter 7 Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks
  9. Altmetric Badge
    Chapter 8 Self-stabilizing Counting in Mobile Sensor Networks with a Base Station
  10. Altmetric Badge
    Chapter 9 Scalable Load-Distance Balancing
  11. Altmetric Badge
    Chapter 10 Time Optimal Asynchronous Self-stabilizing Spanning Tree
  12. Altmetric Badge
    Chapter 11 Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
  13. Altmetric Badge
    Chapter 12 Weakening Failure Detectors for k -Set Agreement Via the Partition Approach
  14. Altmetric Badge
    Chapter 13 Amnesic Distributed Storage
  15. Altmetric Badge
    Chapter 14 Distributed Approximations for Packing in Unit-Disk Graphs
  16. Altmetric Badge
    Chapter 15 From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
  17. Altmetric Badge
    Chapter 16 Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time
  18. Altmetric Badge
    Chapter 17 On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
  19. Altmetric Badge
    Chapter 18 Gossiping in a Multi-channel Radio Network
  20. Altmetric Badge
    Chapter 19 The Space Complexity of Unbounded Timestamps
  21. Altmetric Badge
    Chapter 20 Approximating Wardrop Equilibria with Finitely Many Agents
  22. Altmetric Badge
    Chapter 21 Energy and Time Efficient Broadcasting in Known Topology Radio Networks
  23. Altmetric Badge
    Chapter 22 A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
  24. Altmetric Badge
    Chapter 23 On the Message Complexity of Indulgent Consensus
  25. Altmetric Badge
    Chapter 24 Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
  26. Altmetric Badge
    Chapter 25 Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
  27. Altmetric Badge
    Chapter 26 On the Communication Surplus Incurred by Faulty Processors
  28. Altmetric Badge
    Chapter 27 Output Stability Versus Time Till Output
  29. Altmetric Badge
    Chapter 28 A Distributed Maximal Scheduler for Strong Fairness
  30. Altmetric Badge
    Chapter 29 Cost-Aware Caching Algorithms for Distributed Storage Servers
  31. Altmetric Badge
    Chapter 30 Push-to-Pull Peer-to-Peer Live Streaming
  32. Altmetric Badge
    Chapter 31 Probabilistic Opaque Quorum Systems
  33. Altmetric Badge
    Chapter 32 Detecting Temporal Logic Predicates on Distributed Computations
  34. Altmetric Badge
    Chapter 33 Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
  35. Altmetric Badge
    Chapter 34 Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms
  36. Altmetric Badge
    Chapter 35 Automatic Classification of Eventual Failure Detectors
  37. Altmetric Badge
    Chapter 36 When 3 f  + 1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus
  38. Altmetric Badge
    Chapter 37 On the Complexity of Distributed Greedy Coloring
  39. Altmetric Badge
    Chapter 38 Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks
  40. Altmetric Badge
    Chapter 39 Transaction Safe Nonblocking Data Structures
  41. Altmetric Badge
    Chapter 40 Long Live Continuous Consensus
  42. Altmetric Badge
    Chapter 41 Fully Distributed Algorithms for Convex Optimization Problems
  43. Altmetric Badge
    Chapter 42 On the Power of Impersonation Attacks
  44. Altmetric Badge
    Chapter 43 Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
  45. Altmetric Badge
    Chapter 44 A Formal Analysis of the Deferred Update Technique
  46. Altmetric Badge
    Chapter 45 DISC at Its 20th Anniversary (Stockholm, 2006)
  47. Altmetric Badge
    Chapter 46 DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems
  48. Altmetric Badge
    Chapter 47 DISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982
  49. Altmetric Badge
    Chapter 48 DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems
Attention for Chapter 13: Amnesic Distributed Storage
Altmetric Badge

Readers on

mendeley
4 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
Amnesic Distributed Storage
Chapter number 13
Book title
Distributed Computing
Published by
Springer, Berlin, Heidelberg, September 2007
DOI 10.1007/978-3-540-75142-7_13
Book ISBNs
978-3-54-075141-0, 978-3-54-075142-7
Authors

Gregory Chockler, Rachid Guerraoui, Idit Keidar

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 100%
Readers by discipline Count As %
Computer Science 4 100%