On the public citation graph
Self-organizing data structures
0 signed · 115 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.1002/spe.4380230403openalex-snapshot
An evaluation of self‐adjusting binary search tree techniques
inferredcites →https://doi.org/10.1002/spe.4380230705openalex-snapshot
Longest‐match string searching for ziv‐lempel compression
inferredcites →https://doi.org/10.1006/jagm.1995.1026openalex-snapshot
Self-Adjusting k-ary Search Trees
inferredcites →https://doi.org/10.1006/jagm.1996.0004openalex-snapshot
Weighted Binary Trees for Concurrent Searching
inferredcites →https://doi.org/10.1007/3-540-61440-0_155openalex-snapshot
Average case analyses of list update algorithms, with applications to data compression
inferredcites →https://doi.org/10.1007/bf00264563openalex-snapshot
Nearly optimal binary search trees
inferredcites →https://doi.org/10.1007/bf01188711openalex-snapshot
Fast linear expected-time algorithms for computing maxima and convex hulls
inferredcites →https://doi.org/10.1007/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferredcites →https://doi.org/10.1007/bf01294261openalex-snapshot
Randomized competitive algorithms for the list update problem
inferredcites →https://doi.org/10.1007/bf02579253openalex-snapshot
Sequential access in splay trees takes linear time
inferredcites →https://doi.org/10.1016/0020-0190(82)90083-7openalex-snapshot
A note on some tree similarity measures
inferredcites →https://doi.org/10.1016/0020-0190(88)90153-6openalex-snapshot
On the rotation distance of binary trees
inferredcites →https://doi.org/10.1016/0020-0190(89)90069-0openalex-snapshot
On the upper bound on the rotation distance of binary trees
inferredcites →https://doi.org/10.1016/0020-0190(91)90086-wopenalex-snapshot
Two results on the list update problem
inferredcites →https://doi.org/10.1016/0020-0190(91)90235-aopenalex-snapshot
Self-adjusting multi-way search trees
inferredcites →https://doi.org/10.1016/0020-0190(93)90150-8openalex-snapshot
A lower bound for randomized list update algorithms
inferredcites →https://doi.org/10.1016/0020-0190(95)00142-yopenalex-snapshot
A combined BIT and TIMESTAMP algorithm for the list update problem
inferredcites →https://doi.org/10.1016/0196-6774(87)90048-4openalex-snapshot
The rotation graph of binary trees is Hamiltonian
inferredcites →https://doi.org/10.1016/0304-3975(81)90098-0openalex-snapshot
A generalized counter scheme
inferredcites →https://doi.org/10.1017/s002190020003727xopenalex-snapshot
A counterexample to a conjecture on optimal list ordering
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.1080/02522667.1992.10699094openalex-snapshot
Optimizing Searching with Self-Adjusting Trees
inferredcites →https://doi.org/10.1109/69.234780openalex-snapshot
Adaptive structuring of binary search trees using conditional rotations
inferredcites →https://doi.org/10.1109/sfcs.1979.45openalex-snapshot
Toward self-organizing linear search
inferredcites →https://doi.org/10.1109/sfcs.1989.63534openalex-snapshot
Twists, turns, cascades, deque conjecture, and scanning theorem
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1137/0115076openalex-snapshot
A Probabilistic Model of a Self-Organizing File System
inferredcites →https://doi.org/10.1137/0208007openalex-snapshot
Heuristics That Dynamically Organize Data Structures
inferredcites →https://doi.org/10.1137/0211046openalex-snapshot
Two Spectra of Self-Organizing Sequential Search Algorithms
inferredcites →https://doi.org/10.1137/0218004openalex-snapshot
Lower Bounds for Accessing Binary Search Trees with Rotations
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1137/s0097539794277858openalex-snapshot
Improved Randomized On-Line Algorithms for the List Update Problem
inferredcites →https://doi.org/10.1145/100216.100218openalex-snapshot
On the dynamic finger conjecture for splay trees
inferredcites →https://doi.org/10.1145/12130.12143openalex-snapshot
Rotation distance, triangulations, and hyperbolic geometry
inferredcites →https://doi.org/10.1145/156063.156067openalex-snapshot
Splaying a search tree in preorder takes linear time
inferredcites →https://doi.org/10.1145/22145.22170openalex-snapshot
Self-organizing sequential search and Hilbert's inequalities
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/322092.322094openalex-snapshot
Self-Organizing Binary Search Trees
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/5684.5688openalex-snapshot
A locally adaptive data compression scheme
inferredcites →https://doi.org/10.1145/62212.62243openalex-snapshot
Competitive algorithms for on-line problems
inferredcites →https://doi.org/10.1145/63030.63036openalex-snapshot
Application of splay trees to data compression
inferredcites →https://doi.org/10.1287/opre.13.4.609openalex-snapshot
On Serial Files with Relocatable Records
inferredcites →https://doi.org/10.5555/314161.314180openalex-snapshot
Online list accessing algorithms and their applications: recent empirical evidence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.943openalex-snapshot
An efficient compression scheme for data communication which uses a new family of self‐organizing binary search trees
inferred← citeshttps://doi.org/10.1002/spe.394openalex-snapshot
Self‐adjusting trees in practice for large text collections
inferred← citeshttps://doi.org/10.1007/11427186_49openalex-snapshot
How to Splay for loglogN-Competitiveness
inferred← citeshttps://doi.org/10.1007/11569596_79openalex-snapshot
Efficient Adaptive Data Compression Using Fano Binary Search Trees
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_27openalex-snapshot
Optimal Projective Algorithms for the List Update Problem
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_5openalex-snapshot
Offline List Update is NP-hard
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_26openalex-snapshot
On List Update and Work Function Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-84628-799-2_3openalex-snapshot
A New Hierarchical Approach for Image Clustering
inferred← citeshttps://doi.org/10.1007/978-3-030-04693-4_19openalex-snapshot
The Itinerant List Update Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_23openalex-snapshot
Self-adjusting Linear Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9_29openalex-snapshot
Self-adjusting Linear Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-02621-3_9openalex-snapshot
On Applying Adaptive Data Structures to Multi-Player Game Playing
inferred← citeshttps://doi.org/10.1007/978-3-319-04126-1_16openalex-snapshot
An Experimental Study of a Novel Move-to-Front-or-Middle (MFM) List Update Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-18356-5_29openalex-snapshot
Novel Game Playing Strategies Using Adaptive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-24069-5_21openalex-snapshot
Enhancing History-Based Move Ordering in Game Playing Using Adaptive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_13openalex-snapshot
Relative Worst-Order Analysis: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_2openalex-snapshot
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_35openalex-snapshot
List Update with Locality of Reference
inferred← citeshttps://doi.org/10.1007/978-3-540-87473-7_1openalex-snapshot
Query Responsive Index Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_11openalex-snapshot
List Factoring and Relative Worst Order Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_29openalex-snapshot
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_17openalex-snapshot
A Survey of Algorithms and Models for List Update
inferred← citeshttps://doi.org/10.1007/978-3-662-49619-0_2openalex-snapshot
On Achieving History-Based Move Ordering in Adversarial Board Games Using Adaptive Data Structures
inferred← citeshttps://doi.org/10.1007/978-81-322-0740-5_32openalex-snapshot
Performance Evaluation of A Novel Most Recently Used Frequency Count (MRUFC) List Accessing Algorithm
inferred← citeshttps://doi.org/10.1007/s00453-012-9637-3openalex-snapshot
List Factoring and Relative Worst Order Analysis
inferred← citeshttps://doi.org/10.1007/s00453-018-0461-2openalex-snapshot
On the Separation and Equivalence of Paging Strategies and Other Online Algorithms
inferred← citeshttps://doi.org/10.1007/s10489-016-0835-6openalex-snapshot
Novel threat-based AI strategies that incorporate adaptive data structures for multi-player board games
inferred← citeshttps://doi.org/10.1007/s10489-017-1006-0openalex-snapshot
Challenging state-of-the-art move ordering with Adaptive Data Structures
inferred← citeshttps://doi.org/10.1016/j.ins.2020.03.073openalex-snapshot
Can burrows-Wheeler transform be replaced in chain code compression?
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.10.001openalex-snapshot
Chain-splay trees, or, how to achieve and prove -competitiveness by splaying
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.12.001openalex-snapshot
Optimal strategies for the list update problem under the MRM alternative cost model
inferred← citeshttps://doi.org/10.1016/j.jvcir.2021.103050openalex-snapshot
Lossless chain code compression with an improved Binary Adaptive Sequential Coding of zero-runs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00257-7openalex-snapshot
A new lower bound for the list update problem in the partial cost model
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00253-5openalex-snapshot
On list update and work function algorithms
inferred← citeshttps://doi.org/10.1089/hs.2015.0063openalex-snapshot
A Conceptual Architecture for National Biosurveillance: Moving Beyond Situational Awareness to Enable Digital Detection of Emerging Threats
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.1101/2023.07.17.549219openalex-snapshot
A new universal system of tree shape indices
inferred← citeshttps://doi.org/10.1109/cig.2015.7317956openalex-snapshot
Space and depth-related enhancements of the history-ADS strategy in game playing
inferred← citeshttps://doi.org/10.1109/cscc58962.2023.00015openalex-snapshot
On Move-To-Front Implementation
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796885openalex-snapshot
Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model
inferred← citeshttps://doi.org/10.1109/mami.2015.7456619openalex-snapshot
A novel hybrid approach to list accessing problem using BIT algorithm
inferred← citeshttps://doi.org/10.1109/pdcat.2012.27openalex-snapshot
A Non-blocking Self-Organizing Linked List Algorithm
inferred← citeshttps://doi.org/10.1109/taai.2013.42openalex-snapshot
On Enhancing Recent Multi-player Game Playing Strategies Using a Spectrum of Adaptive Data Structures
inferred← citeshttps://doi.org/10.1109/tnet.2022.3174118openalex-snapshot
Push-Down Trees: Optimal Self-Adjusting Complete Trees
inferred← citeshttps://doi.org/10.1145/1167350.1167389openalex-snapshot
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
inferred← citeshttps://doi.org/10.1145/2500120openalex-snapshot
Optimal lower bounds for projective list update algorithms
inferred← citeshttps://doi.org/10.1145/3138860.3138871openalex-snapshot
SIGACT News Online Algorithms Column 31
inferred← citeshttps://doi.org/10.1145/3219617.3219628openalex-snapshot
On Resource Pooling and Separation for LRU Caching
inferred← citeshttps://doi.org/10.11606/t.55.2004.tde-20082015-105153openalex-snapshot
Recuperação de informação por similaridade utilizando técnicas inteligentes
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3136752/v1openalex-snapshot
Shuffle Tree: A Randomized Self-Adjusting Binary Search Tree
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/2007-06291openalex-snapshot
Æip: a generalized framework for the study of interactive learning
inferred← citeshttps://doi.org/10.22215/etd/2016-11500openalex-snapshot
Enhancing AI-Based Game Playing Using Adaptive Data Structures
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.48550/arxiv.1009.5787openalex-snapshot
List Factoring and Relative Worst Order Analysis
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.