"A Polylogarithmic-Competitive Algorithm for the k-Server Problem."

Nikhil Bansal et al. (2015)

> Home

Details and statistics

DOI: 10.1145/2783434

access: closed

type: Journal Article

metadata version: 2022-02-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/BansalBMN15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/BansalBMN15
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. J. ACM 62(5): 40:1-40:49 (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.