Off-line algorithms for the list update problem (Q1350929): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4886073 / 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: Self-organizing sequential search and Hilbert's inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Account of Self-Organizing Systems / 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: Generation of Permutations by Adjacent Transposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Serial Files with Relocatable Records / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / 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: Q3726126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for randomized list update algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(96)00144-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093003283 / rank
 
Normal rank

Latest revision as of 11:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Off-line algorithms for the list update problem
scientific article

    Statements

    Off-line algorithms for the list update problem (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    Sequential search
    0 references
    List updat
    0 references
    On-line algorithms
    0 references
    Off-line algorithms
    0 references
    Competitive analysis
    0 references
    Analysis of algorithms
    0 references
    0 references