A Faster P Solution for the Byzantine Agreement Problem

DOI10.1007/978-3-642-18123-8_15zbMath1259.68068OpenAlexW1510472088MaRDI QIDQ3067490

Michael J. Dinneen, Radu Nicolescu, Yun-Bum 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)

Related Items (4)

Parallel and Distributed Algorithms in P Systems ⋮ P system implementation of dynamic programming stereo ⋮ Revising the Membrane Computing Model for Byzantine Agreement ⋮ New solutions for disjoint paths in P systems

This page was built for publication: A Faster P Solution for the Byzantine Agreement Problem