On the public citation graph

Stochastic rearrangement rules for self-organizing data structures

https://doi.org/10.1007/bf01759046
0 signed · 29 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/978-1-4419-5780-1_14openalex-snapshot
Markov Chains and Applications
inferredcites →https://doi.org/10.1017/s0021900200024736openalex-snapshot
Self-organizing files with dependent accesses
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/359588.359616openalex-snapshot
Simulations of dynamic sequential search algorithms
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.1287/opre.13.4.609openalex-snapshot
On Serial Files with Relocatable Records
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming

What points at this work

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

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-642-33090-2_28openalex-snapshot
Data Structures on Event Graphs
inferred← citeshttps://doi.org/10.1007/bf02213737openalex-snapshot
An exact formula for the move-to-front rule for self-organizing lists
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/s00453-013-9838-4openalex-snapshot
Data Structures on Event Graphs
inferred← citeshttps://doi.org/10.1007/s00454-009-9170-6openalex-snapshot
Markov Incremental Constructions
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.1016/0020-0255(92)90066-hopenalex-snapshot
Studies of self-organizing placement algorithms for linear and finger lists
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.1142/s0218196719500140openalex-snapshot
Random shuffles on trees using extended promotion
inferred← citeshttps://doi.org/10.1145/1377676.1377701openalex-snapshot
Markov incremental constructions
inferred← citeshttps://doi.org/10.1214/aoap/1177005280openalex-snapshot
Optimality of Move-to-Front for Self-Organizing Data Structures with Locality of References
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.48550/arxiv.1605.08339openalex-snapshot
Random walks on hyperplane arrangements and stopping times
inferred← citeshttps://doi.org/10.48550/arxiv.1908.11764openalex-snapshot
Random shuffles on trees using extended promotion
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.