Competitive \(k\)-server algorithms (Q1329151): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Ressults on Server Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal On-Line Algorithm for <i>K</i> Servers on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast algorithms for two servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive 2-server algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly competitive randomized paging algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0022-0000(05)80060-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157650361 / rank
 
Normal rank

Latest revision as of 12:04, 30 July 2024

scientific article
Language Label Description Also known as
English
Competitive \(k\)-server algorithms
scientific article

    Statements

    Identifiers