An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks (Q1402221): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-002-1010-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2025278163 / rank | |||
Normal rank | |||
Latest revision as of 02:58, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks |
scientific article |
Statements
An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks (English)
0 references
19 August 2003
0 references
Gossiping
0 references
Radio network
0 references
Deterministic algorithm
0 references
