↓ 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 How to build a highly available system using consensus
  3. Altmetric Badge
    Chapter 2 Distributed admission control algorithms for real-time communication
  4. Altmetric Badge
    Chapter 3 Randomization and failure detection: A hybrid approach to solve Consensus
  5. Altmetric Badge
    Chapter 4 Levels of authentication in distributed agreement
  6. Altmetric Badge
    Chapter 5 Efficient and robust sharing of memory in message-passing systems
  7. Altmetric Badge
    Chapter 6 Plausible clocks: Constant size logical clocks for Distributed Systems
  8. Altmetric Badge
    Chapter 7 Abstracting communication to reason about distributed algorithms
  9. Altmetric Badge
    Chapter 8 Simulating reliable links with unreliable links in the presence of process crashes
  10. Altmetric Badge
    Chapter 9 A cyclic distributed garbage collector for network objects
  11. Altmetric Badge
    Chapter 10 Incremental, distributed orphan detection and actor garbage collection using graph partitioning and euler cycles
  12. Altmetric Badge
    Chapter 11 A framework for the analysis of non-deterministic clock synchronisation algorithms
  13. Altmetric Badge
    Chapter 12 Optimal time broadcasting in faulty star networks
  14. Altmetric Badge
    Chapter 13 A lower bound for Linear Interval Routing
  15. Altmetric Badge
    Chapter 14 Topological routing schemes
  16. Altmetric Badge
    Chapter 15 Maintaining a dynamic set of processors in a distributed system
  17. Altmetric Badge
    Chapter 16 Collective consistency
  18. Altmetric Badge
    Chapter 17 Planar quorums
  19. Altmetric Badge
    Chapter 18 “Γ-accurate” failure detectors
  20. Altmetric Badge
    Chapter 19 Fast, long-lived renaming improved and simplified
  21. Altmetric Badge
    Chapter 20 A timestamp based transformation of self-stabilizing programs for distributed computing environments
  22. Altmetric Badge
    Chapter 21 The combinatorial structure of wait-free solvable tasks
  23. Altmetric Badge
    Chapter 22 On the robustness of h m r
  24. Altmetric Badge
    Chapter 23 Understanding the Set Consensus Partial Order using the Borowsky-Gafni Simulation
Attention for Chapter 22: On the robustness of h m r
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 Mendeley
Summary 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
On the robustness of h m r
Chapter number 22
Book title
Distributed Algorithms
Published by
Springer, Berlin, Heidelberg, October 1996
DOI 10.1007/3-540-61769-8_22
Book ISBNs
978-3-54-061769-3, 978-3-54-070679-3
Authors

Shlomo Moran, Lihu Rappoport

View on publisher site

This page is provided by Altmetric.