Distributed Computing
From MaRDI portal
Publication:5395147
DOI10.1007/11561927zbMath1171.68369MaRDI QIDQ5395147
Hugues Fauconnier, Carole Delporte-Gallet, Rachid Guerraoui
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561927
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68P05: Data structures
68M14: Distributed systems
Related Items
Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links, A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems, Asynchronous bounded lifetime failure detectors, The weakest failure detector to solve nonuniform consensus, On the computability power and the robustness of set agreement-oriented failure detector classes, On implementing omega in systems with weak reliability and synchrony assumptions, The Weakest Failure Detector for Message Passing Set-Agreement