An exact formula for the move-to-front rule for self-organizing lists
type: Item
instance of: scholarly article
title: An exact formula for the move-to-front rule for self-organizing lists
zbMATH Open document ID: 0837.60063
DOI: 10.1007/BF02213737
author: James Allen Fill
published in: Journal of Theoretical Probability
publication date: 1996-05-20T00:00:00Z
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 60J20
zbMATH DE Number: 847511
zbMATH Keywords: Markov chains
zbMATH Keywords: self-organizing search
zbMATH Keywords: move-to-front rule
zbMATH Keywords: Tsetlin library
zbMATH Keywords: permutations
zbMATH Keywords: convergence to stationarity
zbMATH Keywords: separation
zbMATH Keywords: eigenvalues
MaRDI profile type: Publication
cites work: Shuffling Cards and Stopping Times
cites work: Strong uniform times and finite random walks
cites work: A locally adaptive data compression scheme
cites work: Heuristics That Dynamically Organize Data Structures
cites work: Q3724546
cites work: Q4776877
cites work: On a model for storage and search
cites work: Strong stationary times via a new form of duality
cites work: Analysis of Top To Random Shuffles
cites work: The heaps process, libraries, and size-biased permutations
cites work: Q5538132
cites work: Exegesis of Self-Organizing Linear Search
cites work: The stationary distribution of an interesting Markov chain
cites work: An Account of Self-Organizing Systems
cites work: Optimal list order under partial memory constraints
cites work: Stochastic rearrangement rules for self-organizing data structures
cites work: Q4096243
cites work: Self-organizing files with dependent accesses
cites work: Data compression
cites work: Transience and recurrence of an interesting Markov chain
cites work: On Serial Files with Relocatable Records
cites work: On the matrix occurring in a linear search problem
cites work: On the transition probabilities of the move-to-front scheme
cites work: On self-organizing sequential search heuristics
cites work: Self-adjusting binary search trees
cites work: Reordering heuristics for routing in communications networks
cites work: FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR
Recommended article: Q4845259
Recommended article: Deterministic optimal and expedient move-to-rear list organizing strategies
Recommended article: Q3785963
Recommended article: List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations
Recommended article: Optimality of move-to-front for self-organizing data structures with locality of references
Recommended article: Stochastic rearrangement rules for self-organizing data structures
Recommended article: The Move-to-Front Rule for Multiple Lists
Recommended article: Q4274208
description: scientific article; zbMATH DE number 847511