On the public citation graph

The Lempel-Ziv algorithm and message complexity

0 signed · 24 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/978-1-4612-3352-7_29openalex-snapshot
Compression, Tests for Randomness and Estimating the Statistical Model of an Individual Sequence
inferredcites →https://doi.org/10.1109/18.2636openalex-snapshot
On classification with empirically observed statistics and universal data compression
inferredcites →https://doi.org/10.1109/tit.1976.1055501openalex-snapshot
On the Complexity of Finite Sequences
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.1983.1056741openalex-snapshot
A universal data compression system

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00453-001-0053-3openalex-snapshot
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source
inferred← citeshttps://doi.org/10.1007/s00477-016-1314-7openalex-snapshot
Complexity analysis of precipitation using the Lempel–Ziv algorithm and a multi-scaling approach: a case study in Jilin province, China
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00298-wopenalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00135-6openalex-snapshot
Optimal data compression algorithm
inferred← citeshttps://doi.org/10.1016/j.ins.2008.12.019openalex-snapshot
On the distribution function of the complexity of finite sequences
inferred← citeshttps://doi.org/10.1017/cbo9780511843204openalex-snapshot
Analytic Pattern Matching
inferred← citeshttps://doi.org/10.1017/s0269964800004502openalex-snapshot
Universal Data Compression Algorithm Based on Approximate String Matching
inferred← citeshttps://doi.org/10.1109/18.370149openalex-snapshot
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
inferred← citeshttps://doi.org/10.1109/18.567640openalex-snapshot
Average redundancy rate of the Lempel-Ziv code
inferred← citeshttps://doi.org/10.1109/afrcon.2002.1146834openalex-snapshot
New correlation attacks on stream ciphers
inferred← citeshttps://doi.org/10.1109/dcc.1995.515516openalex-snapshot
Generalized Lempel-Ziv parsing scheme and its preliminary analysis of the average profile
inferred← citeshttps://doi.org/10.1109/dcc.1997.582052openalex-snapshot
On maximal parsings of strings
inferred← citeshttps://doi.org/10.1109/isit.1995.531116openalex-snapshot
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital trees
inferred← citeshttps://doi.org/10.1109/isit.1997.612929openalex-snapshot
Correlation attacks on stream ciphers using the Lempel-Ziv algorithm
inferred← citeshttps://doi.org/10.1109/sequen.1997.666926openalex-snapshot
Asymmetry in Ziv/Lempel '78 parsing
inferred← citeshttps://doi.org/10.1137/s0097539796301811openalex-snapshot
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
inferred← citeshttps://doi.org/10.1137/s0097539799356812openalex-snapshot
Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme
inferred← citeshttps://doi.org/10.1145/195058.195456openalex-snapshot
A functional equation often arising in the analysis of algorithms (extended abstract)
inferred← citeshttps://doi.org/10.5555/338219.338251openalex-snapshot
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme
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.