scientific article; zbMATH DE number 568828

MaRDI QIDQ4294620zbMATH OpenFDO

Authors Edward T. Ordman

Publication date 4 July 1994

zbMATH Keywords

byzantine problemsdistributed graph recognitionfault-tolerance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 3990887
• Authenticated Algorithms for Byzantine Agreement
• Distributed agreement in the presence of processor and communication faults
• Byzantine approximate agreement on graphs
• How to cope with faulty processors in a completely connected network of communicating processors

This page was built for publication:

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