On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Q2938103)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms |
scientific article |
Statements
On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (English)
0 references
13 January 2015
0 references
