On the public citation graph
A sequential algorithm for the universal coding of finite memory sources
0 signed · 85 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.1109/18.108249openalex-snapshot
Estimating the number of states of a finite-state source
inferredcites →https://doi.org/10.1109/18.32134openalex-snapshot
Asymptotically optimal classification for multiple tests with empirically observed statistics
inferredcites →https://doi.org/10.1109/18.42210openalex-snapshot
On the estimation of the order of a Markov chain and universal data compression
inferredcites →https://doi.org/10.1109/tcom.1981.1095052openalex-snapshot
Compression of Black-White Images with Arithmetic Coding
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
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.1056282openalex-snapshot
Universal modeling and coding
inferredcites →https://doi.org/10.1109/tit.1981.1056355openalex-snapshot
Efficient universal noiseless source codes
inferredcites →https://doi.org/10.1109/tit.1983.1056652openalex-snapshot
Minimax noiseless universal coding for Markov sources
inferredcites →https://doi.org/10.1109/tit.1983.1056741openalex-snapshot
A universal data compression system
inferredcites →https://doi.org/10.1109/tit.1986.1057210openalex-snapshot
Complexity of strings in the class of Markov sources
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/wics.1477openalex-snapshot
Computation of exact probabilities associated with overlapping pattern occurrences
inferred← citeshttps://doi.org/10.1007/3-540-44816-0_23openalex-snapshot
Using Multiattribute Prediction Suffix Graphs for Spanish Part-of-Speech Tagging
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_33openalex-snapshot
Universal Coding of Non-Prefix Context Tree Sources
inferred← citeshttps://doi.org/10.1007/bf00114008openalex-snapshot
The power of amnesia: Learning probabilistic automata with variable memory length
inferred← citeshttps://doi.org/10.1007/s10463-019-00714-6openalex-snapshot
Distributions of pattern statistics in sparse Markov models
inferred← citeshttps://doi.org/10.1016/0378-3758(94)90092-2openalex-snapshot
Predictive stochastic complexity and model estimation for finite-state processes
inferred← citeshttps://doi.org/10.1016/bs.host.2022.03.001openalex-snapshot
Equivalence relations and inference for sparse Markov models
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.06.006openalex-snapshot
Relevant states and memory in Markov chain bootstrapping and simulation
inferred← citeshttps://doi.org/10.1016/j.patrec.2003.08.002openalex-snapshot
Prediction suffix trees for supervised classification of sequences
inferred← citeshttps://doi.org/10.1023/a:1004165822461openalex-snapshot
Model Selection for Variable Length Markov Chains and Tuning the Context Algorithm
inferred← citeshttps://doi.org/10.1023/a:1007396710653openalex-snapshot
Predicting Nearly As Well As the Best Pruning of a Decision Tree
inferred← citeshttps://doi.org/10.1023/a:1007670818503openalex-snapshot
An Efficient Extension to Mixture Techniques for Prediction and Decision Trees
inferred← citeshttps://doi.org/10.1023/a:1026490906255openalex-snapshot
The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length
inferred← citeshttps://doi.org/10.1063/1.4936876openalex-snapshot
Lempel-Ziv complexity analysis of one dimensional cellular automata
inferred← citeshttps://doi.org/10.1093/bioinformatics/btz268openalex-snapshot
A framework for space-efficient variable-order Markov models
inferred← citeshttps://doi.org/10.1093/comjnl/40.2_and_3.76openalex-snapshot
Semantically Motivated Improvements for PPM Variants
inferred← citeshttps://doi.org/10.1109/18.108249openalex-snapshot
Estimating the number of states of a finite-state source
inferred← citeshttps://doi.org/10.1109/18.119694openalex-snapshot
On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences
inferred← citeshttps://doi.org/10.1109/18.256490openalex-snapshot
A rate of convergence result for a universal D-semifaithful code
inferred← citeshttps://doi.org/10.1109/18.265504openalex-snapshot
On the minimum description length principle for sources with piecewise constant parameters
inferred← citeshttps://doi.org/10.1109/18.312161openalex-snapshot
Optimal sequential probability assignment for individual sequences
inferred← citeshttps://doi.org/10.1109/18.335958openalex-snapshot
Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures
inferred← citeshttps://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferred← citeshttps://doi.org/10.1109/18.532891openalex-snapshot
Context weighting for general finite-context sources
inferred← citeshttps://doi.org/10.1109/18.532892openalex-snapshot
Nearest neighbor decoding for additive non-Gaussian noise channels
inferred← citeshttps://doi.org/10.1109/18.623176openalex-snapshot
Sequential prediction and ranking in universal context modeling and data compression
inferred← citeshttps://doi.org/10.1109/18.705569openalex-snapshot
Sequential prediction of individual sequences under general loss functions
inferred← citeshttps://doi.org/10.1109/18.761250openalex-snapshot
Fast universal coding with context models
inferred← citeshttps://doi.org/10.1109/18.782149openalex-snapshot
The asymptotic redundancy of Bayes rules for Markov chains
inferred← citeshttps://doi.org/10.1109/18.841161openalex-snapshot
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
inferred← citeshttps://doi.org/10.1109/18.995542openalex-snapshot
Universal lossless source coding with the Burrows Wheeler transform
inferred← citeshttps://doi.org/10.1109/access.2020.3015493openalex-snapshot
Partial Gated Feedback Recurrent Neural Network for Data Compression Type Classification
inferred← citeshttps://doi.org/10.1109/dcc.1991.213357openalex-snapshot
On the optimal asymptotic performance of universal ordering and discrimination of individual sequences
inferred← citeshttps://doi.org/10.1109/dcc.1995.515497openalex-snapshot
The structure of DMC [dynamic Markov compression]
inferred← citeshttps://doi.org/10.1109/dcc.1997.581957openalex-snapshot
A percolating state selector for suffix-tree context models
inferred← citeshttps://doi.org/10.1109/dcc.1997.581959openalex-snapshot
An executable taxonomy of on-line modeling algorithms
inferred← citeshttps://doi.org/10.1109/dcc.1998.672316openalex-snapshot
Grouping algorithm for lossless data compression
inferred← citeshttps://doi.org/10.1109/dcc.1999.755667openalex-snapshot
Universal lossless source coding with the Burrows Wheeler transform
inferred← citeshttps://doi.org/10.1109/dcc.2000.838200openalex-snapshot
Some notes on the context mapping function in lossless data compression
inferred← citeshttps://doi.org/10.1109/dcc.2004.1281482openalex-snapshot
Linear time universal coding of tree sources via FSM closure
inferred← citeshttps://doi.org/10.1109/dcc.2007.19openalex-snapshot
Bounds on Redundancy in Constrained Delay Arithmetic Coding
inferred← citeshttps://doi.org/10.1109/eeis.1991.217740openalex-snapshot
Comparison between universal data-compression algorithms applied to Markov sources
inferred← citeshttps://doi.org/10.1109/iccs.1992.254940openalex-snapshot
A universal coding scheme based on minimizing minimax redundancy for sources with an unknown model
inferred← citeshttps://doi.org/10.1109/isit.1993.748367openalex-snapshot
Sequential Model Estimation for Universal Coding and the Predictive Stochastic Complexity of Finite-State Sources
inferred← citeshttps://doi.org/10.1109/isit.1993.748374openalex-snapshot
Context Tree Weighting : A Sequential Universal Source Coding Procedure for Fsmx Sources
inferred← citeshttps://doi.org/10.1109/isit.2005.1523438openalex-snapshot
Context tree estimation for not necessarily finite memory processes, via BIC and MDL
inferred← citeshttps://doi.org/10.1109/isit.2007.4557191openalex-snapshot
Twice-Universal Simulation of Markov Sources and Individual Sequences
inferred← citeshttps://doi.org/10.1109/isit.2016.7541493openalex-snapshot
Context Set Weighting method
inferred← citeshttps://doi.org/10.1109/itw.2008.4578634openalex-snapshot
DNA-sequence analysis using Markov chain models
inferred← citeshttps://doi.org/10.1109/itw.2015.7133101openalex-snapshot
One-to-one lossless codes in the variable input-length regime: Back to Kraft's inequality
inferred← citeshttps://doi.org/10.1109/itwf.2015.7360728openalex-snapshot
Source identification and compression of mixture data from finite observations
inferred← citeshttps://doi.org/10.1109/sibircon.2008.4602593openalex-snapshot
Experimental investigation of the genetic text memory using Markov chain models
inferred← citeshttps://doi.org/10.1109/tit.2003.818411openalex-snapshot
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
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.2004.830747openalex-snapshot
Problems on Sequences: Information Theory and Computer Science Interface
inferred← citeshttps://doi.org/10.1109/tit.2004.830763openalex-snapshot
Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure
inferred← citeshttps://doi.org/10.1109/tit.2004.830771openalex-snapshot
Universal Entropy Estimation Via Block Sorting
inferred← citeshttps://doi.org/10.1109/tit.2005.864431openalex-snapshot
Context tree estimation for not necessarily finite memory processes, via BIC and MDL
inferred← citeshttps://doi.org/10.1109/tit.2010.2053870openalex-snapshot
Twice-Universal Simulation of Markov Sources and Individual Sequences
inferred← citeshttps://doi.org/10.1109/tit.2011.2136930openalex-snapshot
BIC Context Tree Estimation for Stationary Ergodic Processes
inferred← citeshttps://doi.org/10.1109/tit.2014.2331954openalex-snapshot
Delay and Redundancy in Lossless Source Coding
inferred← citeshttps://doi.org/10.1145/225298.225305openalex-snapshot
Predicting nearly as well as the best pruning of a decision tree
inferred← citeshttps://doi.org/10.1145/258533.258616openalex-snapshot
Using and combining predictors that specialize
inferred← citeshttps://doi.org/10.1145/267460.267487openalex-snapshot
An efficient extension to mixture techniques for prediction and decision trees
inferred← citeshttps://doi.org/10.1145/267460.267517openalex-snapshot
Learning Markov chains with variable memory length from noisy output
inferred← citeshttps://doi.org/10.1162/014892601753189547openalex-snapshot
Using Multiattribute Prediction Suffix Graphs to Predict and Generate Music
inferred← citeshttps://doi.org/10.13130/zippo-antonio-giuliano_phd2010-12-17openalex-snapshot
NEURONAL ENSEMBLE MODELING AND ANALYSIS WITH VARIABLE ORDER MARKOV MODELS
inferred← citeshttps://doi.org/10.3390/e23091148openalex-snapshot
A Refutation of Finite-State Language Models through Zipf’s Law for Factual Knowledge
inferred← citeshttps://doi.org/10.3929/ethz-a-001873991openalex-snapshot
Model selection for variable length Markov chains and tuning the context algorithm
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.