The complexity of crash failures

DOI10.1145/259380.259438MaRDI QIDQ5361481zbMATH OpenOpenAlexFDO

Authors Mahesh Jayaram, George Varghese

Publication date 29 September 2017

Published in Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/259380.259438

Mathematics Subject Classification ID

Network protocols (68M12) Reliability, testing and fault tolerance of networks and computer systems (68M15) Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• Unifying stabilization and termination in message-passing systems
• Distributed verification of minimum spanning trees

This page was built for publication: The complexity of crash failures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361481)