Tight complexity analysis of population protocols with cover times -- the ZebraNet example (Q391993)
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: Tight complexity analysis of population protocols with cover times -- the ZebraNet example |
scientific article; zbMATH DE number 6244613
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight complexity analysis of population protocols with cover times -- the ZebraNet example |
scientific article; zbMATH DE number 6244613 |
Statements
Tight complexity analysis of population protocols with cover times -- the ZebraNet example (English)
0 references
13 January 2014
0 references
mobile agent networks
0 references
population protocols
0 references
cover times
0 references
worst-case time complexity analysis
0 references
ZebraNet
0 references
