A decomposition theorem for task systems and bounds for randomized server problems (Q2706128)
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: A decomposition theorem for task systems and bounds for randomized server problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decomposition theorem for task systems and bounds for randomized server problems |
scientific article |
Statements
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
A decomposition theorem for task systems and bounds for randomized server problems (English)
0 references
