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

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

> Home

Details and statistics

DOI: 10.1007/S00224-012-9427-Y

access: closed

type: Journal Article

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/BrodalMN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/BrodalMN15
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory Comput. Syst. 56(1): 22-40 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.