On the public citation graph

Fast universal coding with context models

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/bfb0078455openalex-snapshot
Probability Theory and Mathematical Statistics
inferredcites →https://doi.org/10.1109/18.108251openalex-snapshot
Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression
inferredcites →https://doi.org/10.1109/18.135641openalex-snapshot
A sequential algorithm for the universal coding of finite memory sources
inferredcites →https://doi.org/10.1109/18.382011openalex-snapshot
A universal finite memory source
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/18.481776openalex-snapshot
Fisher information and stochastic complexity
inferredcites →https://doi.org/10.1109/83.491334openalex-snapshot
Applications of universal context modeling to lossless compression of gray-scale images
inferredcites →https://doi.org/10.1109/dcc.1996.488332openalex-snapshot
Bi-level image compression with tree coding
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1109/tit.1981.1056331openalex-snapshot
The performance of universal encoding
inferredcites →https://doi.org/10.1109/tit.1983.1056741openalex-snapshot
A universal data compression system
inferredcites →https://doi.org/10.1109/tit.1984.1056936openalex-snapshot
Universal coding, information, prediction, and estimation
inferredcites →https://doi.org/10.1109/tit.1987.1057385openalex-snapshot
Conditional limit theorems under Markov conditioning
inferredcites →https://doi.org/10.1142/2898openalex-snapshot
Probability Theory and Mathematical Statistics
inferredcites →https://doi.org/10.2307/2553898openalex-snapshot
Convergence of Stochastic Processes.

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-3-540-85776-1_1openalex-snapshot
Context Model for Multi-Agent System Reconfiguration
inferred← citeshttps://doi.org/10.1007/s00453-001-0010-1openalex-snapshot
Robust Distance-Based Clustering with Applications to Spatial Data Mining
inferred← citeshttps://doi.org/10.1007/s10115-007-0091-5openalex-snapshot
Optimal segmentation using tree models
inferred← citeshttps://doi.org/10.1080/07408170490426125openalex-snapshot
Statistical process control via context modeling of finite-state processes: an application to production monitoring
inferred← citeshttps://doi.org/10.1109/cesa.2006.4281840openalex-snapshot
Adaptive Context Based Coding for Lossless Color Image Compression
inferred← citeshttps://doi.org/10.1109/icdm.2006.122openalex-snapshot
Optimal Segmentation Using Tree Models
inferred← citeshttps://doi.org/10.1109/isit.2000.866361openalex-snapshot
On asymptotically optimal methods of prediction and adaptive coding for Markov sources with unknown memory
inferred← citeshttps://doi.org/10.1109/tc.2005.56openalex-snapshot
Antisequential Suffix Sorting for BWT-Based Data Compression
inferred← citeshttps://doi.org/10.1109/tit.2004.826664openalex-snapshot
An $O(N)$ Semipredictive Universal Encoder via the BWT
inferred← citeshttps://doi.org/10.1109/tit.2006.871041openalex-snapshot
Faster sequential universal coding via block partitioning
inferred← citeshttps://doi.org/10.1109/tit.2006.885484openalex-snapshot
Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes
inferred← citeshttps://doi.org/10.1109/tit.2008.917666openalex-snapshot
On Finite Memory Universal Data Compression and Classification of Individual Sequences
inferred← citeshttps://doi.org/10.1198/004017003000000122openalex-snapshot
Context-Based Statistical Process Control
inferred← citeshttps://doi.org/10.3390/e21070645openalex-snapshot
Context Based Predictive Information
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.