Byzantine renaming in synchronous systems with t < N

DOI10.1145/2484239.2484261MaRDI QIDQ5176096zbMATH OpenOpenAlexWikidataFDO

Authors Oksana Denysyuk, Luis Rodrigues

Publication date 2 March 2015

Published in Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

Byzantine failuresrandomized algorithmsrenaming problemsynchronous message passing model

Mathematics Subject Classification ID

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

Recommendations

• Brief announcement
• Renaming in synchronous message passing systems with Byzantine failures
• Renaming in Message Passing Systems with Byzantine Failures
• Renaming in an asynchronous environment
• Balls-into-leaves, sub-logarithmic renaming in synchronous message-passing systems

Cited in

(5)

• Renaming in synchronous message passing systems with Byzantine failures
• Balls-into-leaves, sub-logarithmic renaming in synchronous message-passing systems
• Renaming in Message Passing Systems with Byzantine Failures
• Brief announcement
• Strong order-preserving renaming in the synchronous message passing model

This page was built for publication: Byzantine renaming in synchronous systems with \(t < N\)

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