On the public citation graph
Fixed data base version of the Lempel-Ziv data compression algorithm
0 signed · 57 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.45281openalex-snapshot
Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1145/322234.322237openalex-snapshot
Linear Algorithm for Data Compression via String Matching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/gps.6112openalex-snapshot
Neural markers of reduced arousal and consciousness in mild cognitive impairment
inferred← citeshttps://doi.org/10.1007/978-1-4471-1281-5_11openalex-snapshot
Evolutionary Cellular Automata for Image Compression
inferred← citeshttps://doi.org/10.1007/978-1-4615-2694-0_42openalex-snapshot
The Sliding-Window Lempel-Ziv Algorithm is Asymptotically Optimal
inferred← citeshttps://doi.org/10.1007/978-3-030-96040-7_61openalex-snapshot
A Lossless Compression Algorithm Based on High Frequency Intensity Removal for Grayscale Images
inferred← citeshttps://doi.org/10.1007/978-3-0348-7915-6_20openalex-snapshot
Using Tries for Universal Data Compression
inferred← citeshttps://doi.org/10.1007/978-94-010-0870-9_73openalex-snapshot
Neural Predictors for Detecting and Removing Redundant Information
inferred← citeshttps://doi.org/10.1007/978-94-015-8729-7_29openalex-snapshot
An Entropy Estimator Algorithm and Telecommunications Applications
inferred← citeshttps://doi.org/10.1016/s0020-0255(01)00099-8openalex-snapshot
Compression in the presence of shared data
inferred← citeshttps://doi.org/10.1016/s0020-0255(01)00103-7openalex-snapshot
Optimal encoding of non-stationary sources
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00308-6openalex-snapshot
Redundancy estimates for the Lempel–Ziv algorithm of data compression
inferred← citeshttps://doi.org/10.1103/physreve.79.046208openalex-snapshot
Entropy estimation of very short symbolic sequences
inferred← citeshttps://doi.org/10.1109/18.144707openalex-snapshot
Large deviations for the asymptotics of Ziv-Lempel codes for 2-D Gibbs fields
inferred← citeshttps://doi.org/10.1109/18.149506openalex-snapshot
A recurrence theorem for dependent processes with applications to data compression
inferred← citeshttps://doi.org/10.1109/18.243444openalex-snapshot
A measure of relative entropy between individual sequences with application to universal classification
inferred← citeshttps://doi.org/10.1109/18.259648openalex-snapshot
Asymptotic properties of data compression and suffix trees
inferred← citeshttps://doi.org/10.1109/18.265494openalex-snapshot
On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
inferred← citeshttps://doi.org/10.1109/18.605570openalex-snapshot
On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
inferred← citeshttps://doi.org/10.1109/18.623144openalex-snapshot
The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
inferred← citeshttps://doi.org/10.1109/18.641559openalex-snapshot
On fixed-database universal data compression with limited memory
inferred← citeshttps://doi.org/10.1109/18.650988openalex-snapshot
On sliding-window universal data compression with limited memory
inferred← citeshttps://doi.org/10.1109/18.661522openalex-snapshot
Redundancy of the Lempel-Ziv string matching code
inferred← citeshttps://doi.org/10.1109/18.705559openalex-snapshot
An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis
inferred← citeshttps://doi.org/10.1109/18.782108openalex-snapshot
The shortest common superstring problem: average case analysis for both exact and approximate matching
inferred← citeshttps://doi.org/10.1109/18.796370openalex-snapshot
An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
inferred← citeshttps://doi.org/10.1109/5.286191openalex-snapshot
The sliding-window Lempel-Ziv algorithm is asymptotically optimal
inferred← citeshttps://doi.org/10.1109/83.988964openalex-snapshot
2D-pattern matching image and video compression: theory, algorithms, and experiments
inferred← citeshttps://doi.org/10.1109/acssc.1997.679123openalex-snapshot
Second-order analysis of lossless and lossy versions of Lempel-Ziv codes
inferred← citeshttps://doi.org/10.1109/dcc.2001.917154openalex-snapshot
Software compression in the client/server environment
inferred← citeshttps://doi.org/10.1109/dcc.2001.917171openalex-snapshot
Overlap in adaptive vector quantization
inferred← citeshttps://doi.org/10.1109/dcc.2008.103openalex-snapshot
On Precision-Redundancy Relation in the Design of Source Coding Algorithms
inferred← citeshttps://doi.org/10.1109/isit.1994.394963openalex-snapshot
The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
inferred← citeshttps://doi.org/10.1109/isit.1998.708878openalex-snapshot
Asymptotically optimal lossy Lempel-Ziv coding
inferred← citeshttps://doi.org/10.1109/isit.2002.1023395openalex-snapshot
On tries, suffix trees, and universal variable-length-to-block codes
inferred← citeshttps://doi.org/10.1109/isit.2015.7282804openalex-snapshot
On redundancy rate of FDLZ algorithm and its variants
inferred← citeshttps://doi.org/10.1109/itw.2015.7133103openalex-snapshot
Point-wise analysis of redundancy in SWLZ algorithm for φ-mixing sources
inferred← citeshttps://doi.org/10.1109/itw.2016.7606807openalex-snapshot
On point-wise redundancy rate of Bender-Wolf's variant of SWLZ algorithm
inferred← citeshttps://doi.org/10.1109/itwksps.2010.5503137openalex-snapshot
Almost sure optimality of sliding window Lempel-Ziv algorithm and variants
inferred← citeshttps://doi.org/10.1109/ncc.2013.6487918openalex-snapshot
Sequential change detection using estimators of entropy & divergence rate
inferred← citeshttps://doi.org/10.1109/sequen.1997.666907openalex-snapshot
Compression of low entropy strings with Lempel-Ziv algorithms
inferred← citeshttps://doi.org/10.1109/tit.2002.1003819openalex-snapshot
Shannon theory: perspective, trends, and applications special issue dedicated to aaron d. wyner
inferred← citeshttps://doi.org/10.1109/tit.2002.1003841openalex-snapshot
Source coding, large deviations, and approximate pattern matching
inferred← citeshttps://doi.org/10.1109/tit.2003.809491openalex-snapshot
Pattern matching and lossy data compression on random fields
inferred← citeshttps://doi.org/10.1109/tit.2008.2006449openalex-snapshot
Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case
inferred← citeshttps://doi.org/10.1109/tit.2013.2259291openalex-snapshot
Almost Sure Optimality of Sliding Window Lempel–Ziv Algorithm and Variants Revisited
inferred← citeshttps://doi.org/10.1109/tit.2014.2368986openalex-snapshot
On Match Lengths, Zero Entropy, and Large Deviations—With Application to Sliding Window Lempel–Ziv Algorithm
inferred← citeshttps://doi.org/10.1109/tits.2014.2325395openalex-snapshot
Limits of Predictability for Large-Scale Urban Vehicular Mobility
inferred← citeshttps://doi.org/10.1134/s0032946012040072openalex-snapshot
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
inferred← citeshttps://doi.org/10.1137/s0097539797331105openalex-snapshot
Compression of Low Entropy Strings with Lempel--Ziv Algorithms
inferred← citeshttps://doi.org/10.1145/3637528.3671995openalex-snapshot
Quantifying and Estimating the Predictability Upper Bound of Univariate Numeric Time Series
inferred← citeshttps://doi.org/10.1147/rd.501.0149openalex-snapshot
An approximation to the greedy algorithm for differential compression
inferred← citeshttps://doi.org/10.1214/aoap/1029962749openalex-snapshot
The asymptotics of waiting times between stationary processes, allowing distortion
inferred← citeshttps://doi.org/10.48550/arxiv.0904.3340openalex-snapshot
Lossy Compression in Near-Linear Time via Efficient Random Codebooks and Databases
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.