"OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm."

Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu (2015)

Details and statistics

DOI: 10.1007/S00224-012-9427-Y

access: closed

type: Journal Article

metadata version: 2019-10-19

a service of  Schloss Dagstuhl - Leibniz Center for Informatics