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

Distributed Computing

Overview of attention for book
Cover of 'Distributed Computing'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Early-Delivery Dynamic Atomic Broadcast
  3. Altmetric Badge
    Chapter 2 Secure Computation without Agreement
  4. Altmetric Badge
    Chapter 3 The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses
  5. Altmetric Badge
    Chapter 4 Condition-Based Protocols for Set Agreement Problems
  6. Altmetric Badge
    Chapter 5 Distributed Agreement and Its Relation with Error-Correcting Codes
  7. Altmetric Badge
    Chapter 6 On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
  8. Altmetric Badge
    Chapter 7 Transformations of Self-Stabilizing Algorithms
  9. Altmetric Badge
    Chapter 8 Simple Wait-Free Multireader Registers
  10. Altmetric Badge
    Chapter 9 An Efficient Universal Construction for Message-Passing Systems
  11. Altmetric Badge
    Chapter 10 Ruminations on Domain-Based Reliable Broadcast
  12. Altmetric Badge
    Chapter 11 Stateless Termination Detection
  13. Altmetric Badge
    Chapter 12 RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
  14. Altmetric Badge
    Chapter 13 Ad Hoc Membership for Scalable Applications
  15. Altmetric Badge
    Chapter 14 Assignment-Based Partitioning in a Condition Monitoring System
  16. Altmetric Badge
    Chapter 15 Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
  17. Altmetric Badge
    Chapter 16 Failure Detection Lower Bounds on Registers and Consensus
  18. Altmetric Badge
    Chapter 17 Improved Compact Routing Scheme for Chordal Graphs
  19. Altmetric Badge
    Chapter 18 A Practical Multi-word Compare-and-Swap Operation
  20. Altmetric Badge
    Chapter 19 Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection
  21. Altmetric Badge
    Chapter 20 Bounding Work and Communication in Robust Cooperative Computation
  22. Altmetric Badge
    Chapter 21 Minimal Byzantine Storage
  23. Altmetric Badge
    Chapter 22 Wait-Free n-Set Consensus When Inputs Are Restricted
  24. Altmetric Badge
    Chapter 23 The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures
  25. Altmetric Badge
    Chapter 24 On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems
Attention for Chapter 21: Minimal Byzantine Storage
Altmetric Badge

Mentioned by

patent
1 patent

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
23 Mendeley
Summary Patents Dimensions citations
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
Minimal Byzantine Storage
Chapter number 21
Book title
Distributed Computing
Published by
Springer, Berlin, Heidelberg, October 2002
DOI 10.1007/3-540-36108-1_21
Book ISBNs
978-3-54-000073-0, 978-3-54-036108-4
Authors

Jean-Philippe Martin, Lorenzo Alvisi, Michael Dahlin

View on publisher site
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 %
Unknown 23 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 9 39%
Researcher 4 17%
Other 2 9%
Student > Master 2 9%
Student > Doctoral Student 1 4%
Other 4 17%
Unknown 1 4%
Readers by discipline Count As %
Computer Science 15 65%
Engineering 7 30%
Unknown 1 4%

This page is provided by Altmetric.