Message complexity versus space complexity in fault tolerant broadcast protocols (Q4730761)
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 4115940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Message complexity versus space complexity in fault tolerant broadcast protocols |
scientific article; zbMATH DE number 4115940 |
Statements
Message complexity versus space complexity in fault tolerant broadcast protocols (English)
0 references
1989
0 references
message complexity
0 references
protocols
0 references
network of asynchronous processors
0 references
general lower bound
0 references
0.8482953906059265
0 references
0.8101757764816284
0 references
0.803320586681366
0 references
0.8012174367904663
0 references
