Better computing on the anonymous ring (Q3361868)
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 4215342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Better computing on the anonymous ring |
scientific article; zbMATH DE number 4215342 |
Statements
Better computing on the anonymous ring (English)
0 references
1991
0 references
average complexity
0 references
asynchronous deterministic algorithm
0 references
lower bound
0 references
asynchronous probabilistic algorithm
0 references
Monte-Carlo asynchronous algorithm
0 references
0.9008020758628844
0 references
0.8602498173713684
0 references
0.8602498173713684
0 references
0.8498217463493347
0 references
0.8493869304656982
0 references
