On the public citation graph
Exegesis of Self-Organizing Linear Search
0 signed · 75 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(78)90059-5openalex-snapshot
Notes on the derivation of symptotic expressions from summations
inferredcites →https://doi.org/10.1016/0029-5582(60)90320-5openalex-snapshot
Asymptotic methods in analysis
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.1145/322092.322094openalex-snapshot
Self-Organizing Binary Search Trees
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.1287/opre.13.4.609openalex-snapshot
On Serial Files with Relocatable Records
inferredcites →https://doi.org/10.2307/2003554openalex-snapshot
Table of Integrals, Series, and Products
inferredcites →https://doi.org/10.2307/2004114openalex-snapshot
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables
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.20214openalex-snapshot
The persistent‐access‐caching algorithm
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_46openalex-snapshot
Expedient stochastic move-to-front and optimal stochastic move-to-rear list organizing strategies
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_120openalex-snapshot
Random allocations and probabilistic languages
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_12openalex-snapshot
Two New Families of List Update Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-50171-1_10openalex-snapshot
On using conditional rotation operations to adaptively structure binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-51859-2_11openalex-snapshot
Optimal constant space move-to-fear list organization
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_159openalex-snapshot
A relationship between self-organizing lists and binary search trees
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_85openalex-snapshot
Adaptive linear list reorganization for a system processing set queries
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_155openalex-snapshot
Average case analyses of list update algorithms, with applications to data compression
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_156openalex-snapshot
Self-organizing data structures with dependent accesses
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_44openalex-snapshot
Generalized swap-with-parent schemes for self-organizing sequential linear lists
inferred← citeshttps://doi.org/10.1007/978-3-642-21786-9_3openalex-snapshot
On Merging the Fields of Neural Networks and Adaptive Data Structures to Yield New Pattern Recognition Methodologies
inferred← citeshttps://doi.org/10.1007/bf01759046openalex-snapshot
Stochastic rearrangement rules for self-organizing data structures
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/pl00009217openalex-snapshot
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
inferred← citeshttps://doi.org/10.1007/s12597-026-01181-3openalex-snapshot
Bridging theory and practice: novel adaptive frameworks for self-organizing sequential search problem under uncertainty
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90201-9openalex-snapshot
Study of selforganizing heuristics for skewed access patterns
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00014-xopenalex-snapshot
On lookahead in the list update problem
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/0022-0000(88)90025-6openalex-snapshot
Self-organizing sequential search and Hilbert's inequalities
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90177-copenalex-snapshot
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90136-6openalex-snapshot
Deterministic optimal and expedient move-to-rear list organizing strategies
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90166-qopenalex-snapshot
An optimal absorbing list organization strategy with constant memory requirements
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50038-1openalex-snapshot
ENHANCING DATA RETRIEVAL USING ARTIFICIALLY SYNTHESIZED QUERIES
inferred← citeshttps://doi.org/10.1016/j.geb.2013.03.011openalex-snapshot
Decentralized utilitarian mechanisms for scheduling games
inferred← citeshttps://doi.org/10.1016/j.protcy.2012.10.067openalex-snapshot
TRANS Outperforms MTF for Two Special Types of Request Sequence Without Locality of Reference
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10246-xopenalex-snapshot
Multiplicities of eigenvalues of some linear search schemes
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00264-3openalex-snapshot
On the competitiveness of the move-to-front rule
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80204-xopenalex-snapshot
Chapter 7 Fundamental algorithms and data structures
inferred← citeshttps://doi.org/10.1017/s0021900200016405openalex-snapshot
Applying POS(i) rules to communication problems
inferred← citeshttps://doi.org/10.1017/s0021900200024736openalex-snapshot
Self-organizing files with dependent accesses
inferred← citeshttps://doi.org/10.1017/s0021900200037475openalex-snapshot
Comparison of self-organizing linear search rules
inferred← citeshttps://doi.org/10.1017/s0021900200039723openalex-snapshot
On the matrix occurring in a linear search problem
inferred← citeshttps://doi.org/10.1017/s0021900200106333openalex-snapshot
Reordering heuristics for routing in communications networks
inferred← citeshttps://doi.org/10.1080/15326349208807227openalex-snapshot
Stochastic reversibility in self-organizing systems
inferred← citeshttps://doi.org/10.1093/comjnl/bxh073openalex-snapshot
Self-Adjusting of Ternary Search Tries Using Conditional Rotations and Randomized Heuristics
inferred← citeshttps://doi.org/10.1093/comjnl/bxl067openalex-snapshot
A Novel Framework for Self-Organizing Lists in Environments with Locality of Reference: Lists-on-Lists
inferred← citeshttps://doi.org/10.1109/12.75146openalex-snapshot
Deterministic learning automata solutions to the equipartitioning problem
inferred← citeshttps://doi.org/10.1109/69.234780openalex-snapshot
Adaptive structuring of binary search trees using conditional rotations
inferred← citeshttps://doi.org/10.1109/esic64052.2025.10962784openalex-snapshot
LED-Based Adaptive Algorithm: A Novel Integration of Logit and Exponential Decay for Self-Organizing Sequential Search Problem
inferred← citeshttps://doi.org/10.1109/pccc.2000.830303openalex-snapshot
Move-to-front and transpose hybrid parallel architectures for high-speed data compression
inferred← citeshttps://doi.org/10.1137/0213020openalex-snapshot
Self-Organizing Heuristics for Implicit Data Structures
inferred← citeshttps://doi.org/10.1137/0216047openalex-snapshot
List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations
inferred← citeshttps://doi.org/10.1145/1186810.1186817openalex-snapshot
Entropy-based bounds for online algorithms
inferred← citeshttps://doi.org/10.1145/130844.130853openalex-snapshot
Analyzing algorithms by simulation
inferred← citeshttps://doi.org/10.1145/146585.146588openalex-snapshot
An optimal on-line algorithm for metrical task system
inferred← citeshttps://doi.org/10.1145/1993636.1993708openalex-snapshot
Inner product spaces for MinSum coordination mechanisms
inferred← citeshttps://doi.org/10.1145/22145.22170openalex-snapshot
Self-organizing sequential search and Hilbert's inequalities
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.1145/33447.33453openalex-snapshot
Self-organizing search lists using probabilistic back-pointers
inferred← citeshttps://doi.org/10.1145/42005.42018openalex-snapshot
Fast object partitioning using Stochastic learning automata
inferred← citeshttps://doi.org/10.1147/rd.386.0683openalex-snapshot
Memory versus randomization in on-line algorithms
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.1287/opre.1090.0761openalex-snapshot
Analysis of Page Replacement Policies in the Fluid Limit
inferred← citeshttps://doi.org/10.22215/etd/2006-06665openalex-snapshot
Tries in data retrieval and syntactic pattern recognition
inferred← citeshttps://doi.org/10.22215/etd/2018-13392openalex-snapshot
On Designing Adaptive Data Structures with Adaptive Data "Sub"-Structures
inferred← citeshttps://doi.org/10.46298/dmtcs.3360openalex-snapshot
Near optimality of the discrete persistent access caching algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1010.1886openalex-snapshot
Inner Product Spaces for MinSum Coordination Mechanisms
inferred← citeshttps://doi.org/10.5120/2601-3627openalex-snapshot
Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm
inferred← citeshttps://doi.org/10.5555/365411.365764openalex-snapshot
Can entropy characterize performance of online algorithms
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.