A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems (Q2706128): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Avrim L. Blum / rank | |||
| Property / author | |||
| Property / author: Howard J. Karloff / rank | |||
| Property / author | |||
| Property / author: Michael E. Saks / rank | |||
| Property / author | |||
| Property / author: Avrim L. Blum / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Howard J. Karloff / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Michael E. Saks / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 08:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems |
scientific article |
Statements
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems (English)
0 references
19 March 2001
0 references
lower bounds
0 references
randomized algorithms
0 references
\(k\)-server
0 references
task systems
0 references
on-line algorithms
0 references
competitive analysis
0 references
