Skip to content

Opening book details…

About this Computer Science article

Bounding the Power of Preemption in Randomized Scheduling by Canetti, Ran; Irani, Sandy is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Canetti, Ran; Irani, Sandy
Publisher
Society for Industrial and Applied Mathematics; Society for Industrial & Applied Mathematics (SIAM) (ISSN 0097-5397)
Published
1998
Field
Computer Science (Physical Sciences)

More by Canetti, Ran; Irani, Sandy

Browse all works by Canetti, Ran; Irani, Sandy