A competitive analysis of the list update problem with lookahead (Q1128665): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the influence of lookahead in competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined BIT and TIMESTAMP algorithm for the list update problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted list update problem and the lazy adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new measure for the study of on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization in on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A locally adaptive data compression scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics That Dynamically Organize Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On competitive on-line paging with lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a model for storage and search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic location problem for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of a theorem concerning an interesting Markov chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two results on the list update problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online matching with blocked input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized competitive algorithms for the list update problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-organizing sequential search heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for randomized list update algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231924 / rank
 
Normal rank

Latest revision as of 14:44, 28 May 2024

scientific article
Language Label Description Also known as
English
A competitive analysis of the list update problem with lookahead
scientific article

    Statements

    A competitive analysis of the list update problem with lookahead (English)
    0 references
    0 references
    13 August 1998
    0 references
    linear lists
    0 references
    on-line algorithms
    0 references
    competitive analysis
    0 references
    lookahead
    0 references

    Identifiers