On the public citation graph

Redundancy of the Context-Tree Weighting Method on Renewal and Markov Renewal Processes

0 signed · 33 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/b99352openalex-snapshot
Statistical Learning Theory and Stochastic Optimization
inferredcites →https://doi.org/10.1109/18.212281openalex-snapshot
Universal redundancy rates do not exist
inferredcites →https://doi.org/10.1109/18.312161openalex-snapshot
Optimal sequential probability assignment for individual sequences
inferredcites →https://doi.org/10.1109/18.382012openalex-snapshot
The context-tree weighting method: basic properties
inferredcites →https://doi.org/10.1109/18.556120openalex-snapshot
Minimax redundancy for the class of memoryless sources
inferredcites →https://doi.org/10.1109/18.556596openalex-snapshot
Redundancy rates for renewal and other processes
inferredcites →https://doi.org/10.1109/18.605594openalex-snapshot
A general minimax result for relative entropy
inferredcites →https://doi.org/10.1109/18.720554openalex-snapshot
The minimum description length principle in coding and modeling
inferredcites →https://doi.org/10.1109/18.761250openalex-snapshot
Fast universal coding with context models
inferredcites →https://doi.org/10.1109/isit.1993.748430openalex-snapshot
Universal Redundancy Rates Don't Exist
inferredcites →https://doi.org/10.1109/isit.1994.394632openalex-snapshot
Extensions to the context tree weighting method
inferredcites →https://doi.org/10.1109/tit.1981.1056282openalex-snapshot
Universal modeling and 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.2005.864431openalex-snapshot
Context tree estimation for not necessarily finite memory processes, via BIC and MDL
inferredcites →https://doi.org/10.1214/aos/1015957472openalex-snapshot
The consistency of the BIC Markov order estimator
inferredcites →https://doi.org/10.1214/aos/1018031204openalex-snapshot
Variable length Markov chains
inferredcites →https://doi.org/10.1214/aos/1176345870openalex-snapshot
Nonparametric Estimation in Renewal 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-319-96262-7_2openalex-snapshot
Universal Coding on Finite Alphabets
inferred← citeshttps://doi.org/10.1080/07350015.2021.2000418openalex-snapshot
Composite Index Construction with Expert Opinion
inferred← citeshttps://doi.org/10.1109/bmsb.2014.6873552openalex-snapshot
Regional context model and dynamic Huffman binarization for adaptive entropy coding of multimedia
inferred← citeshttps://doi.org/10.1109/icct.2011.6157839openalex-snapshot
Cross-layer optimization for IEEE 802.11 DCF in fading channels
inferred← citeshttps://doi.org/10.1109/tit.2006.881742openalex-snapshot
Consistency of the Unlimited BIC Context Tree Estimator
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.1109/tit.2013.2288914openalex-snapshot
About Adaptive Coding on Countable Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2015.2496200openalex-snapshot
Stochastic Processes With Random Contexts: A Characterization and Adaptive Estimators for the Transition Probabilities
inferred← citeshttps://doi.org/10.1214/11-aoas511openalex-snapshot
Context tree selection and linguistic rhythm retrieval from written texts
inferred← citeshttps://doi.org/10.1214/16-aos1455openalex-snapshot
Approximate group context tree
inferred← citeshttps://doi.org/10.46298/dmtcs.2995openalex-snapshot
Adaptive compression against a countable alphabet
inferred← citeshttps://doi.org/10.48550/arxiv.0804.2050openalex-snapshot
Stochastic chains with memory of variable length
inferred← citeshttps://doi.org/10.48550/arxiv.1103.2058openalex-snapshot
Perfect simulation for locally continuous chains of infinite order
inferred← citeshttps://doi.org/10.48550/arxiv.1809.02741openalex-snapshot
A high dimensional Central Limit Theorem for martingales, with applications to context tree models
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.