On the public citation graph

List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations

https://doi.org/10.1137/0216047
0 signed · 48 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.1016/0167-6423(82)90016-8openalex-snapshot
Smoothsort, an alternative for sorting in situ
inferredcites →https://doi.org/10.1016/c2009-1-28569-8openalex-snapshot
A First Course in Stochastic Processes
inferredcites →https://doi.org/10.1017/s0021900200094870openalex-snapshot
The stationary distribution of an interesting Markov chain
inferredcites →https://doi.org/10.1017/s0021900200096091openalex-snapshot
An extension of a theorem concerning 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/s0021900200118595openalex-snapshot
On a model for storage and search
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.1137/0211046openalex-snapshot
Two Spectra of Self-Organizing Sequential Search Algorithms
inferredcites →https://doi.org/10.1145/359024.359026openalex-snapshot
Best sorting algorithm for nearly sorted lists
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

What points at this work

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

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-51486-4_85openalex-snapshot
Generalizing singly-linked list reorganizing heuristics for doubly-linked lists
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-63890-3_44openalex-snapshot
Generalized swap-with-parent schemes for self-organizing sequential linear lists
inferred← citeshttps://doi.org/10.1007/978-3-540-78604-7_24openalex-snapshot
Solving Graph Coloring Problems Using Learning Automata
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/s10489-012-0351-2openalex-snapshot
An adaptive focused Web crawling algorithm based on learning automata
inferred← citeshttps://doi.org/10.1007/s10844-012-0197-4openalex-snapshot
An adaptive learning automata-based ranking function discovery algorithm
inferred← citeshttps://doi.org/10.1007/s10922-010-9178-5openalex-snapshot
A Learning Automata-Based Cognitive Radio for Clustered Wireless Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/s11227-010-0484-1openalex-snapshot
A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs
inferred← citeshttps://doi.org/10.1007/s12293-016-0183-4openalex-snapshot
A new memetic algorithm based on cellular learning automata for solving the vertex coloring 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/0196-6774(91)90032-topenalex-snapshot
Self-organizing lists and independent references: A statistical synergy
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.dss.2012.08.005openalex-snapshot
An adaptive learning to rank algorithm: Learning automata approach
inferred← citeshttps://doi.org/10.1016/j.engappai.2010.01.009openalex-snapshot
Combining finite learning automata with GSAT for the satisfiability problem
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.06.030openalex-snapshot
A Michigan memetic algorithm for solving the community detection problem in complex network
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/s026996480000259xopenalex-snapshot
The Application of Restricted Counter Schemes to Three Models of Linear Search
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.1109/12.75146openalex-snapshot
Deterministic learning automata solutions to the equipartitioning problem
inferred← citeshttps://doi.org/10.1109/21.400511openalex-snapshot
Switching models for nonstationary random environments
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/icsmc.1993.384935openalex-snapshot
On modelling non-stationary random environments using switching techniques
inferred← citeshttps://doi.org/10.1109/pdgc64653.2024.10983939openalex-snapshot
Enhancing Sequential Access Efficiency in Data Compression: An Alpha-Parameterized Extension to MFLP for Dynamic Reorganization
inferred← citeshttps://doi.org/10.1109/tencon.1994.369296openalex-snapshot
An adaptive dynamic file migration algorithm in distributed computer systems
inferred← citeshttps://doi.org/10.21203/rs.3.rs-4942743/v1openalex-snapshot
Optimization based on Multi-Meme Memetic Algorithm
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.31390/gradschool_disstheses.5834openalex-snapshot
A Self-Adaptive Database Buffer Replacement Scheme.
inferred← citeshttps://doi.org/10.4018/978-1-4666-0270-0.ch017openalex-snapshot
Stochastic Learning for SAT- Encoded Graph Coloring Problems
inferred← citeshttps://doi.org/10.4018/jamc.2010070101openalex-snapshot
Stochastic Learning for SAT- Encoded Graph Coloring Problems
inferred← citeshttps://doi.org/10.5772/8610openalex-snapshot
Using Learning Automata to Enhance Local-Search Based SAT Solvers with Learning Capability
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.