A new measure for the study of on-line algorithms (Q1312188): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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: Q3138906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3977465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly competitive randomized paging algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010308 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:33, 22 May 2024

scientific article
Language Label Description Also known as
English
A new measure for the study of on-line algorithms
scientific article

    Statements

    A new measure for the study of on-line algorithms (English)
    0 references
    0 references
    0 references
    0 references
    26 January 1994
    0 references
    0 references
    competitive analysis
    0 references
    on-line algorithm
    0 references