M. Epstein

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We study the problem of online scheduling on two uniform machines with speeds 1 and s 1. A 1:61803 competitive deterministic algorithm was already known. We present the rst randomized results for this problem: We show that randomization does not help for speeds s 2, but does help for all s < 2. We present a simple memoryless randomized algorithm with(More)
  • 1