Solving Election Problem in Asynchronous Distributed Systems

DOI10.1007/11758501_98MaRDI QIDQ3545064zbMATH OpenOpenAlexFDO

Authors Seonghoon Park

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758501_98

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes
• scientific article; zbMATH DE number 1983303
• scientific article; zbMATH DE number 2009837
• scientific article; zbMATH DE number 1948959
• On the hardness of failure-sensitive agreement problems.

Cited in

(7)

• scientific article; zbMATH DE number 6909297 (Why is no real title available?)
• The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes
• How to assign votes in a distributed system
• scientific article; zbMATH DE number 4096766 (Why is no real title available?)
• scientific article; zbMATH DE number 1948959 (Why is no real title available?)
• scientific article; zbMATH DE number 1983303 (Why is no real title available?)
• scientific article; zbMATH DE number 2009837 (Why is no real title available?)

This page was built for publication: Solving Election Problem in Asynchronous Distributed Systems

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