On the public citation graph
Analytic variations on redundancy rates of renewal processes
0 signed · 46 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/9781118032770openalex-snapshot
Average Case Analysis of Algorithms on Sequences
inferredcites →https://doi.org/10.1006/jsco.1999.0281openalex-snapshot
Symbolic Asymptotics: Multiseries of Inverse Functions
inferredcites →https://doi.org/10.1007/3-540-45995-2_29openalex-snapshot
Generalized Shannon Code Minimizes the Maximal Redundancy
inferredcites →https://doi.org/10.1007/978-3-642-61310-4_2openalex-snapshot
Asymptotic Methods in Analysis
inferredcites →https://doi.org/10.1007/bf01303793openalex-snapshot
The coefficients of certain power series
inferredcites →https://doi.org/10.1007/s00453-001-0053-3openalex-snapshot
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source
inferredcites →https://doi.org/10.1016/0012-365x(95)00139-nopenalex-snapshot
Analytic methods in asymptotic enumeration
inferredcites →https://doi.org/10.1016/0304-3975(94)00298-wopenalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
inferredcites →https://doi.org/10.1016/0304-3975(95)00002-eopenalex-snapshot
Mellin transforms and asymptotics: Harmonic sums
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.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.567640openalex-snapshot
Average redundancy rate of the Lempel-Ziv code
inferredcites →https://doi.org/10.1109/18.567642openalex-snapshot
Redundancy of the Lempel-Ziv incremental parsing rule
inferredcites →https://doi.org/10.1109/18.623144openalex-snapshot
The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
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.761251openalex-snapshot
Entropy computations via analytic depoissonization
inferredcites →https://doi.org/10.1109/18.887856openalex-snapshot
Asymptotic average redundancy of Huffman (and other) block codes
inferredcites →https://doi.org/10.1109/isit.1997.612919openalex-snapshot
Back from infinity: a constrained resources approach to information theory
inferredcites →https://doi.org/10.1109/tit.1986.1057210openalex-snapshot
Complexity of strings in the class of Markov sources
inferredcites →https://doi.org/10.1112/jlms/s1-7.4.256openalex-snapshot
The Coefficients of a Certain Power Series
inferredcites →https://doi.org/10.1112/plms/s2-17.1.75openalex-snapshot
Asymptotic Formulaae in Combinatory Analysis
inferredcites →https://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferredcites →https://doi.org/10.2307/2005805openalex-snapshot
Applied and Computational Complex Analysis
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-0348-8211-8_19openalex-snapshot
A Combinatorial Problem Arising in Information Theory: Precise Minimax Redundancy for Markov Sources
inferred← citeshttps://doi.org/10.1007/s00009-018-1076-1openalex-snapshot
Reciprocal Function Series Coefficients with Integer Partitions
inferred← citeshttps://doi.org/10.1109/allerton.2015.7447108openalex-snapshot
Single letter characterization of average-case strong redundancy of compressing memoryless sequences
inferred← citeshttps://doi.org/10.1109/isit.2000.866668openalex-snapshot
Asymptotic average redundancy of Huffman (and Shannon-Fano) block codes
inferred← citeshttps://doi.org/10.1109/isit.2010.5513572openalex-snapshot
Minimax redundancy for large alphabets
inferred← citeshttps://doi.org/10.1109/isit.2019.8849635openalex-snapshot
Tail redundancy and its characterizations of universal compression
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518175openalex-snapshot
A Lower Bound for Regret in Logistic Regression
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834809openalex-snapshot
Precise Minimax Regret for Logistic Regression
inferred← citeshttps://doi.org/10.1109/jsait.2023.3243989openalex-snapshot
Tail Redundancy and its Characterization of Compression of Memoryless Sources
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.836702openalex-snapshot
Precise Minimax Redundancy and Regret
inferred← citeshttps://doi.org/10.1109/tit.2008.928985openalex-snapshot
Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness
inferred← citeshttps://doi.org/10.1109/tit.2010.2103831openalex-snapshot
Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes
inferred← citeshttps://doi.org/10.1109/tit.2012.2195769openalex-snapshot
Minimax Pointwise Redundancy for Memoryless Models Over Large Alphabets
inferred← citeshttps://doi.org/10.1109/tit.2023.3279197openalex-snapshot
Regret Bounds for Log-Loss via Bayesian Algorithms
inferred← citeshttps://doi.org/10.1561/0100000090openalex-snapshot
Redundancy of Lossless Data Compression for Known Sources by Analytic Methods
inferred← citeshttps://doi.org/10.1587/essfr.6.12openalex-snapshot
Explanation of Second-Order Asymptotic Theory Via Information Spectrum Method
inferred← citeshttps://doi.org/10.46298/dmtcs.3555openalex-snapshot
Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding
inferred← citeshttps://doi.org/10.48550/arxiv.1211.1440openalex-snapshot
Explicit formulas using partitions of integers for numbers defined by recursion
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.