A lower bound for two-server balancing algorithms (Q1336749): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1986840063 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New Ressults on Server Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On fast algorithms for two servers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Approach to the Server Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A competitive 2-server algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Competitive algorithms for server problems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:12, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound for two-server balancing algorithms |
scientific article |
Statements
A lower bound for two-server balancing algorithms (English)
0 references
26 February 1996
0 references