A faster P solution for the Byzantine agreement problem

DOI10.1007/978-3-642-18123-8_15MaRDI QIDQ3067490zbMATH OpenOpenAlexFDO

Authors Michael J. Dinneen, Radu Nicolescu, Yun B. Kim

Publication date 21 January 2011

Published in Membrane Computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.613.534

zbMATH Keywords

distributed algorithmsP systemsByzantine agreementmodular designP modules

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• P systems and the Byzantine agreement
• Revising the membrane computing model for Byzantine agreement
• Modular construction of an efficient 1-bit Byzantine agreement protocol
• A new solution for the Byzantine generals problem
• Fast Byzantine agreement

Cited in

(10)

• New solutions for disjoint paths in P systems
• P systems and the Byzantine agreement
• Actor-like cP systems
• Fast fault-tolerant agreement algorithms
• Revising the membrane computing model for Byzantine agreement
• A New Solution to Detectable Byzantine Agreement Problem
• Fast Paxos
• A new solution for the Byzantine agreement problem
• Parallel and distributed algorithms in P systems
• P system implementation of dynamic programming stereo

This page was built for publication: A faster P solution for the Byzantine agreement problem

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