Bounding the Power of Preemption in Randomized Scheduling (Q4210081)

From MaRDI portal
Revision as of 14:56, 6 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    20 September 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    randomized algorithms
    0 references
    scheduling
    0 references
    preemption
    0 references
    lower bounds
    0 references