Money transfer made simple: a specification, a generic algorithm, and its proof (Q5011847)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7387977
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Money transfer made simple: a specification, a generic algorithm, and its proof |
scientific article; zbMATH DE number 7387977 |
Statements
30 August 2021
0 references
asynchronous message-passing system
0 references
Byzantine process
0 references
distributed computing
0 references
efficiency
0 references
fault tolerance
0 references
FIFO message order
0 references
modularity
0 references
money transfer
0 references
process crash
0 references
reliable broadcast
0 references
simplicity
0 references
0.6990798711776733
0 references
0.6972471475601196
0 references
0.695531964302063
0 references
0.6954687833786011
0 references
0.6892317533493042
0 references
