A Survey of Algorithms and Models for List Update (Q2848979): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved Randomized On-Line Algorithms for the List Update Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: On List Update with Locality of Reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case analyses of list update algorithms, with applications to data compression / 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: Q2753921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the list update problem in the partial cost model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Update with Locality of Reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paging and list update under bijective analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitive theory and practice of online list accessing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / 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: A locally adaptive data compression scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging with locality of reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative worst order ratio for online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative worst-order ratio applied to paging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LRU is better than FIFO / rank
 
Normal rank
Property / cites work
 
Property / cites work: The working set model for program behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: List factoring and relative worst order analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating online scheduling algorithms with the relative worst order ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing online algorithms for bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal strategies for the list update problem under the MRM alternative cost model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and Offline Access to Short Lists / 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: Strongly Competitive Algorithms for Paging with Locality of Reference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230342 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitiveness of the move-to-front rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Serial Files with Relocatable Records / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Off-line algorithms for the list update problem / 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: A unified analysis of paging and caching / rank
 
Normal rank

Latest revision as of 21:34, 6 July 2024

scientific article
Language Label Description Also known as
English
A Survey of Algorithms and Models for List Update
scientific article

    Statements

    A Survey of Algorithms and Models for List Update (English)
    0 references
    0 references
    0 references
    13 September 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references