Belated analyses of three credit-based adaptive polling algorithms (Q2833543)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Belated analyses of three credit-based adaptive polling algorithms |
scientific article; zbMATH DE number 6654711
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Belated analyses of three credit-based adaptive polling algorithms |
scientific article; zbMATH DE number 6654711 |
Statements
18 November 2016
0 references
polling
0 references
broadcasting
0 references
bit message complexity
0 references
random tree
0 references
distribution of degrees
0 references
asynchronous communication
0 references
0.8293462
0 references
0.8142357
0 references
0.81216353
0 references
0.8113509
0 references
0.80977434
0 references
0 references
0 references
0 references
Belated analyses of three credit-based adaptive polling algorithms (English)
0 references
