"The k-Server Dual and Loose Competitiveness for Paging."

Neal E. Young (1994)

> Home

Details and statistics

DOI: 10.1007/BF01189992

access: closed

type: Journal Article

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Young94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Young94
Neal E. Young:
The k-Server Dual and Loose Competitiveness for Paging. Algorithmica 11(6): 525-541 (1994)

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.