Two distributed problems involving Byzantine processes

DOI10.1016/0304-3975(92)90072-NzbMath0745.68023MaRDI QIDQ1186434

Joffroy Beauquier

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

distributed systemsprotocolsmutual exclusion problemnaming problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• How to share a secret
• Distributed network protocols
• Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
• Reaching Agreement in the Presence of Faults
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: Two distributed problems involving Byzantine processes