OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. | BibSonomy

OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm.
, , and .
WAOA, volume 7164 of Lecture Notes in Computer Science, page 164-175. Springer, (2011)

  • @dblp
This publication has not been reviewed yet.

rating distribution
average user rating0.0 out of 5.0 based on 0 reviews
    Please log in to take part in the discussion (add own reviews or comments).