On the public citation graph

Average Case Analyses of List Update Algorithms, with Applications to Data Compression

https://doi.org/10.1007/pl00009217
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.1007/bf01294261openalex-snapshot
Randomized competitive algorithms for the list update problem
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(93)90150-8openalex-snapshot
A lower bound for randomized list update algorithms
inferredcites →https://doi.org/10.1017/s0963548397003209openalex-snapshot
Large Deviation Bounds for Markov Chains
inferredcites →https://doi.org/10.1137/0210046openalex-snapshot
Exegesis of Self-Organizing Linear Search
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/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/5684.5688openalex-snapshot
A locally adaptive data compression scheme
inferredcites →https://doi.org/10.5555/313651.313812openalex-snapshot
Splay trees for data compression
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/1097-024x(20001110)30:13<1465::aid-spe345>3.0.co;2-dopenalex-snapshot
Improvements to Burrows-Wheeler compression algorithm
inferred← citeshttps://doi.org/10.1002/9781119259770.biblioopenalex-snapshot
Bibliography
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.426openalex-snapshot
Second step algorithms in the Burrows–Wheeler compression algorithm
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-34874-3_7openalex-snapshot
Online Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_2openalex-snapshot
Online Algorithms: A Study of Graph-Theoretic Concepts
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_9openalex-snapshot
On List Update with Locality of Reference
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-642-02011-7_14openalex-snapshot
An Application of Self-organizing Data Structures to Compression
inferred← citeshttps://doi.org/10.1007/978-3-642-29116-6_13openalex-snapshot
A New Perspective on List Update: Probabilistic Locality and Working Set
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/s00453-001-0069-8openalex-snapshot
On the Competitive Theory and Practice of Online List Accessing Algorithms
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/s10107-003-0436-0openalex-snapshot
Online algorithms: a survey
inferred← citeshttps://doi.org/10.1016/b978-012443895-8/50009-xopenalex-snapshot
Data Compression
inferred← citeshttps://doi.org/10.1016/j.ic.2016.06.007openalex-snapshot
On the list update problem with advice
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.04.002openalex-snapshot
List update with probabilistic locality of reference
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.11.005openalex-snapshot
On list update with locality of reference
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.013openalex-snapshot
Weighted forward looking adaptive coding
inferred← citeshttps://doi.org/10.1109/dcc.2000.838158openalex-snapshot
Switching between two on-line list update algorithms for higher compression of Burrows-Wheeler transformed data
inferred← citeshttps://doi.org/10.1109/dcc.2014.86openalex-snapshot
Better Compression through Better List Update Algorithms
inferred← citeshttps://doi.org/10.1109/iscis.2007.4456829openalex-snapshot
A new approach to adaptive encoding data using self-organizing data structures
inferred← citeshttps://doi.org/10.1137/090766437openalex-snapshot
Self-Improving Algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611973068.123openalex-snapshot
Paging and List Update under Bijective Analysis
inferred← citeshttps://doi.org/10.1145/1186810.1186817openalex-snapshot
Entropy-based bounds for online algorithms
inferred← citeshttps://doi.org/10.1145/2450142.2450143openalex-snapshot
Paging and list update under bijective analysis
inferred← citeshttps://doi.org/10.1145/3179408openalex-snapshot
On Resource Pooling and Separation for LRU Caching
inferred← citeshttps://doi.org/10.1145/3219617.3219628openalex-snapshot
On Resource Pooling and Separation for LRU Caching
inferred← citeshttps://doi.org/10.12794/metadc2909openalex-snapshot
Higher Compression from the Burrows-Wheeler Transform with New Algorithms for the List Update Problem
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/2018-13392openalex-snapshot
On Designing Adaptive Data Structures with Adaptive Data "Sub"-Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1311.7357openalex-snapshot
On the List Update Problem with Advice
inferred← citeshttps://doi.org/10.5555/1109557.1109587openalex-snapshot
Self-improving algorithms
inferred← citeshttps://doi.org/10.5555/1496770.1496893openalex-snapshot
Paging and list update under bijective analysis
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.