Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu. OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst., 56(1):22-40, 2015. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: OnlineMin: A Fast Strongly Competitive Randomized Paging AlgorithmGerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu. waoa 2012: 164-175 [doi] Improved Space Bounds for Strongly Competitive Randomized Paging AlgorithmsGabriel Moruz, Andrei Negoescu. icalp 2013: 757-768 [doi]
The following publications are possibly variants of this publication: