Parameterized analysis of paging and list update algorithms (Q2346961): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-013-9800-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988381536 / rank
 
Normal rank
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: 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: 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: Q4633928 / 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: 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: Q3579430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theoretical comparison of LRU and LRU-K / 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: The relative worst order ratio applied to seat reservation / 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: Parameterized Analysis of Paging and List Update Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relative dominance of paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler analysis of Burrows-Wheeler-based compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Paging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Competitive Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the Burrows—Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adequate performance measures for paging / 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: Q4344125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified analysis of paging and caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Paging Against Adversarially Biased Random Inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line file caching / rank
 
Normal rank

Latest revision as of 03:47, 10 July 2024

scientific article
Language Label Description Also known as
English
Parameterized analysis of paging and list update algorithms
scientific article

    Statements

    Parameterized analysis of paging and list update algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2015
    0 references
    online algorithms
    0 references
    paging
    0 references
    list update
    0 references
    locality of reference
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers