A tight unconditional lower bound on distributed randomwalk computation (Q2943404)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight unconditional lower bound on distributed randomwalk computation |
scientific article |
Statements
A tight unconditional lower bound on distributed randomwalk computation (English)
0 references
11 September 2015
0 references
communication complexity
0 references
distributed algorithms
0 references
lower bound
0 references
random walk
0 references
time complexity
0 references
0 references
0 references
