Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
A competitive 2-server algorithm
Sandy Irani
*
,
Ronitt Rubinfeld
*
Corresponding author for this work
University of California at Berkeley
Research output
:
Contribution to journal
›
Article
›
peer-review
20
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A competitive 2-server algorithm'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Metric Space
100%
Arithmetic Operations
33%
One-variable
33%
Total Distance
33%
Online Algorithms
33%
Offline Algorithm
33%
Number of Points
33%
Server Failure
33%
Number of Requests
33%
K-server Problem
33%
Two-server
33%
Balancing Algorithm
33%
Mobile Server
33%
Computer Science
Metric Space
100%
on-line algorithm
66%
Arithmetic Operation
33%
Total Distance
33%
Modified Version
33%
Memory Location
33%
Mathematics
Metric Space
100%
Minimizes
33%
Total Cost
33%
Arithmetic Operation
33%