P systems and the Byzantine agreement
From MaRDI portal
Publication:987968
DOI10.1016/j.jlap.2010.03.004zbMath1208.68116OpenAlexW1987248909MaRDI QIDQ987968
Yun-Bum Kim, Radu Nicolescu, Michael J. Dinneen
Publication date: 24 August 2010
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2010.03.004
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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 ⋮ Faster synchronization in P systems
Cites Work
- Faster synchronization in P systems
- Membrane computing. An introduction.
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?
- Fast quantum byzantine agreement
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Fast Synchronization in P Systems
- Discovering the Membrane Topology of Hyperdag P Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: P systems and the Byzantine agreement
