Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms (Q2464381)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms |
scientific article |
Statements
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms (English)
0 references
20 December 2007
0 references
