Bounding the Power of Preemption in Randomized Scheduling (Q4210081)
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: Bounding the Power of Preemption in Randomized Scheduling |
scientific article; zbMATH DE number 1200713
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounding the Power of Preemption in Randomized Scheduling |
scientific article; zbMATH DE number 1200713 |
Statements
Bounding the Power of Preemption in Randomized Scheduling (English)
0 references
20 September 1998
0 references
randomized algorithms
0 references
scheduling
0 references
preemption
0 references
lower bounds
0 references