Revising the membrane computing model for Byzantine agreement
From MaRDI portal
Recommendations
Cites work
- A faster P solution for the Byzantine agreement problem
- Fast quantum byzantine agreement
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- scientific article; zbMATH DE number 1951582 (Why is no real title available?)
- P systems and the Byzantine agreement
- Parallel and distributed algorithms in P systems
- Parallel Thinning with Complex Objects and Actors
- Programming P Systems with Complex Objects
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- Reaching Agreement in the Presence of Faults
- Structured grid algorithms modelled with complex objects
- The Byzantine Generals Problem
Cited in
(3)
This page was built for publication: Revising the membrane computing model for Byzantine agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2975922)