On the public citation graph

An exact formula for the move-to-front rule for self-organizing lists

0 signed · 90 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01759046openalex-snapshot

Stochastic rearrangement rules for self-organizing data structures

inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot

An introduction to probability theory and its applications

inferredcites →https://doi.org/10.1016/0196-8858(87)90006-6openalex-snapshot

Strong uniform times and finite random walks

inferredcites →https://doi.org/10.1017/s0021900200024736openalex-snapshot

Self-organizing files with dependent accesses

inferredcites →https://doi.org/10.1017/s0021900200039711openalex-snapshot

The heaps process, libraries, and size-biased permutations

inferredcites →https://doi.org/10.1017/s0021900200039723openalex-snapshot

On the matrix occurring in a linear search problem

inferredcites →https://doi.org/10.1017/s0021900200045083openalex-snapshot

On the transition probabilities of the move-to-front scheme

inferredcites →https://doi.org/10.1017/s0021900200094870openalex-snapshot

The stationary distribution of an interesting Markov chain

inferredcites →https://doi.org/10.1017/s0021900200097291openalex-snapshot

Optimal list order under partial memory constraints

inferredcites →https://doi.org/10.1017/s0021900200106333openalex-snapshot

Reordering heuristics for routing in communications networks

inferredcites →https://doi.org/10.1017/s002190020011825xopenalex-snapshot

Transience and recurrence of an interesting Markov chain

inferredcites →https://doi.org/10.1017/s0021900200118595openalex-snapshot

On a model for storage and search

inferredcites →https://doi.org/10.1017/s0963548300000158openalex-snapshot

Analysis of Top To Random Shuffles

inferredcites →https://doi.org/10.1070/rm1963v018n04abeh001139openalex-snapshot

FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR

inferredcites →https://doi.org/10.1080/00029890.1986.11971821openalex-snapshot

Shuffling Cards and Stopping Times

inferredcites →https://doi.org/10.1090/conm/034/777701openalex-snapshot

Orderings of Coxeter groups

inferredcites →https://doi.org/10.1093/imamat/13.3.263openalex-snapshot

HEAPS: A Concept in Optimization

inferredcites →https://doi.org/10.1111/j.2517-6161.1975.tb01024.xopenalex-snapshot

Random Discrete Distributions

inferredcites →https://doi.org/10.1137/0205050openalex-snapshot

An Account of Self-Organizing Systems

inferredcites →https://doi.org/10.1137/0208007openalex-snapshot

Heuristics That Dynamically Organize Data Structures

inferredcites →https://doi.org/10.1137/0210046openalex-snapshot

Exegesis of Self-Organizing Linear Search

inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot

Amortized efficiency of list update and paging rules

inferredcites →https://doi.org/10.1145/3341.3349openalex-snapshot

Amortized analyses of self-organizing sequential search heuristics

inferredcites →https://doi.org/10.1145/359997.360000openalex-snapshot

On self-organizing sequential search heuristics

inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot

Self-adjusting binary search trees

inferredcites →https://doi.org/10.1145/45072.45074openalex-snapshot

Data compression

inferredcites →https://doi.org/10.1145/5505.5507openalex-snapshot

Self-organizing linear search

inferredcites →https://doi.org/10.1145/5684.5688openalex-snapshot

A locally adaptive data compression scheme

inferredcites →https://doi.org/10.1214/aop/1176990628openalex-snapshot

Strong Stationary Times Via a New Form of Duality

inferredcites →https://doi.org/10.1287/opre.13.4.609openalex-snapshot

On Serial Files with Relocatable Records

inferredcites →https://doi.org/10.2307/2314609openalex-snapshot

An Introduction to Probability Theory and Its Applications.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.10096openalex-snapshot

Speeding up the FMMR perfect sampling algorithm: A case study revisited

inferred← citeshttps://doi.org/10.1007/978-1-4612-0801-3_5openalex-snapshot

The Move-To-Front Rule for Self-Organizing Lists with Markov Dependent Requests

inferred← citeshttps://doi.org/10.1007/978-1-4939-0938-4_13openalex-snapshot

Markov Chains for Promotion Operators

inferred← citeshttps://doi.org/10.1007/978-3-319-43932-7_14openalex-snapshot

14 Markov Chains

inferred← citeshttps://doi.org/10.1007/978-3-642-30541-2_1openalex-snapshot

Hypergraph Coloring Games and Voter Models

inferred← citeshttps://doi.org/10.1007/pl00009245openalex-snapshot

The List Update Problem: Improved Bounds for the Counter Scheme

inferred← citeshttps://doi.org/10.1007/s00026-016-0332-yopenalex-snapshot

Generalizations of an Expansion Formula for Top to Random Shuffles

inferred← citeshttps://doi.org/10.1007/s00440-018-0872-7openalex-snapshot

Optimal strong stationary times for random walks on the chambers of a hyperplane arrangement

inferred← citeshttps://doi.org/10.1007/s10801-013-0470-9openalex-snapshot

Combinatorial Markov chains on linear extensions

inferred← citeshttps://doi.org/10.1007/s10801-017-0783-1openalex-snapshot

Properties of the promotion Markov chain on linear extensions

inferred← citeshttps://doi.org/10.1007/s10959-018-0834-0openalex-snapshot

Lumpings of Algebraic Markov Chains Arise from Subquotients

inferred← citeshttps://doi.org/10.1007/s11083-016-9420-1openalex-snapshot

Markov Chains on Graded Posets

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00210-3openalex-snapshot

Limits and rates of convergence for the distribution of search cost under the move-to-front rule

inferred← citeshttps://doi.org/10.1016/j.aam.2011.06.002openalex-snapshot

Edge flipping in graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2014.06.014openalex-snapshot

A note on an alternating upper bound for random walks on semigroups

inferred← citeshttps://doi.org/10.1016/j.laa.2009.05.008openalex-snapshot

Comparison of subdominant eigenvalues of some linear search schemes

inferred← citeshttps://doi.org/10.1016/j.orl.2017.12.008openalex-snapshot

Eigenvalues of LRU via a linear algebraic approach

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.029openalex-snapshot

Least-recently-used caching with dependent requests

inferred← citeshttps://doi.org/10.1017/s0021900200000188openalex-snapshot

A Transposition Rule Analysis Based on a Particle Process

inferred← citeshttps://doi.org/10.1017/s0021900200002394openalex-snapshot

Critical sizing of LRU caches with dependent requests

inferred← citeshttps://doi.org/10.1017/s0021900200103195openalex-snapshot

Convergence to stationary state for a Markov move-to-front scheme

inferred← citeshttps://doi.org/10.1017/s0269964800005192openalex-snapshot

The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms

inferred← citeshttps://doi.org/10.1017/s0269964899131073openalex-snapshot

MOVE-TO-FRONT RULE FOR ACCESSING SEVERAL RECORDS

inferred← citeshttps://doi.org/10.1017/s096354830400625xopenalex-snapshot

Optimizing LRU Caching for Variable Document Sizes

inferred← citeshttps://doi.org/10.1023/a:1007822931408openalex-snapshot

Semigroups, Rings, and Markov Chains

inferred← citeshttps://doi.org/10.1051/ps/2019004openalex-snapshot

Antiduality and Möbius monotonicity: generalized coupon collector problem

inferred← citeshttps://doi.org/10.1080/00029890.1999.12005079openalex-snapshot

Random Walks and Plane Arrangements in Three Dimensions

inferred← citeshttps://doi.org/10.1080/07362999608809426openalex-snapshot

The move-to-root rule for self-organizing trees with Markov dependent requests∗

inferred← citeshttps://doi.org/10.1080/15427951.2013.833676openalex-snapshot

Hypergraph Coloring Games and Voter Models

inferred← citeshttps://doi.org/10.1081/stm-120002777openalex-snapshot

The move-to-partner rule for self-organizing task allocation on a linear array

inferred← citeshttps://doi.org/10.1109/infcom.2003.1208695openalex-snapshot

Asymptotic insensitivity of least-recently-used caching to statistical dependency

inferred← citeshttps://doi.org/10.1109/infocom.2018.8485860openalex-snapshot

Asymptotic Miss Ratio of LRU Caching with Consistent Hashing

inferred← citeshttps://doi.org/10.1109/infocom.2018.8485891openalex-snapshot

LRU Caching with Dependent Competing Requests

inferred← citeshttps://doi.org/10.1109/jsac.2018.2844984openalex-snapshot

Accurate Learning or Fast Mixing? Dynamic Adaptability of Caching Algorithms

inferred← citeshttps://doi.org/10.1109/tit.2005.856941openalex-snapshot

Asymptotic Redundancy of the MTF Scheme for Stationary Ergodic Sources

inferred← citeshttps://doi.org/10.1109/tit.2006.878177openalex-snapshot

A Comparison of Methods for Redundancy Reduction in Recurrence Time Coding

inferred← citeshttps://doi.org/10.1109/tmc.2025.3591423openalex-snapshot

A Unified Diffusion Framework for Traffic Imputation and Prediction With Physical Priors

inferred← citeshttps://doi.org/10.1137/21m1421994openalex-snapshot

Upper Bounds on Mixing Time of Finite Markov Chains

inferred← citeshttps://doi.org/10.1145/1035334.1035348openalex-snapshot

An asymptotic optimality of the transposition rule for linear lists

inferred← citeshttps://doi.org/10.1145/2825236.2825260openalex-snapshot

Miss behavior for caching with lease

inferred← citeshttps://doi.org/10.1145/3219617.3219628openalex-snapshot

On Resource Pooling and Separation for LRU Caching

inferred← citeshttps://doi.org/10.1145/3308809.3308824openalex-snapshot

On Resource Pooling and Separation for LRU Caching

inferred← citeshttps://doi.org/10.1214/09-aap635openalex-snapshot

The limiting move-to-front search-cost in law of large numbers asymptotic regimes

inferred← citeshttps://doi.org/10.1214/18-ecp111openalex-snapshot

Limiting behaviour of the stationary search cost distribution driven by a generalized gamma process

inferred← citeshttps://doi.org/10.1214/aoap/1029962750openalex-snapshot

Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities

inferred← citeshttps://doi.org/10.1214/aoap/1177004824openalex-snapshot

On the Markov Chain for the Move-to-Root Rule for Binary Search Trees

inferred← citeshttps://doi.org/10.1214/aop/1022855884openalex-snapshot

Random walks and hyperplane arrangements

inferred← citeshttps://doi.org/10.1215/s0012-7094-99-09906-4openalex-snapshot

A combinatorial description of the spectrum for the Tsetlin library and its generalization to hyperplane arrangements

inferred← citeshttps://doi.org/10.1239/jap/1110381383openalex-snapshot

A Transposition Rule Analysis Based on a Particle Process

inferred← citeshttps://doi.org/10.2748/tmj/1303219937openalex-snapshot

Stochastic ranking process with time dependent intensities

inferred← citeshttps://doi.org/10.2996/kmj/1383660688openalex-snapshot

Tagged particle dynamics in stochastic ranking process

inferred← citeshttps://doi.org/10.2996/kmj/1383660689openalex-snapshot

Functional central limit theorem for tagged particle dynamics in stochastic ranking process

inferred← citeshttps://doi.org/10.30757/alea.v19-40openalex-snapshot

Functional central limit theorem for tagged particle dynamics in stochastic ranking process with space-time dependent intensities

inferred← citeshttps://doi.org/10.3150/17-bej930openalex-snapshot

Leading the field: Fortune favors the bold in Thurstonian choice models

inferred← citeshttps://doi.org/10.37236/10678openalex-snapshot

The Eigenvalues of Hyperoctahedral Descent Operators and Applications to Card-Shuffling

inferred← citeshttps://doi.org/10.48550/arxiv.0908.3222openalex-snapshot

Hydrodynamic limit of move-to-front rules and search cost probabilities

inferred← citeshttps://doi.org/10.48550/arxiv.1006.1321openalex-snapshot

No Feedback Card Guessing for Top to Random Shuffles

inferred← citeshttps://doi.org/10.48550/arxiv.1609.04312openalex-snapshot

Markov Chains from Descent Operators on Combinatorial Hopf Algebras

inferred← citeshttps://doi.org/10.5802/alco.346openalex-snapshot

The one-sided cycle shuffles in the symmetric group algebra

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.