Off-line algorithms for the list update problem (Q1350929): 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: 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
links / mardi / namelinks / mardi / name
 

Revision as of 11:07, 27 May 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