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

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

> Home

Details and statistics

DOI: 10.1007/978-3-642-29116-6_14

access: closed

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/waoa/BrodalMN11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/waoa/BrodalMN11
Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu:
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. WAOA 2011: 164-175

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.