On the public citation graph
Gipfeli - High Speed Compression Algorithm
0 signed · 26 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/dcc.1991.213344openalex-snapshot
An extremely fast Ziv-Lempel data compression algorithm
inferredcites →https://doi.org/10.1109/dcc.1997.582019openalex-snapshot
A corpus for the evaluation of lossless compression algorithms
inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1145/214762.214771openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.1145/63334.63341openalex-snapshot
Data compression with finite windows
inferredcites →https://doi.org/10.17487/rfc1950openalex-snapshot
ZLIB Compressed Data Format Specification version 3.3
inferredcites →https://doi.org/10.5555/1298455.1298475openalex-snapshot
Bigtable: a distributed storage system for structured data
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-24947-6_28openalex-snapshot
High Speed Lossless Image Compression
inferred← citeshttps://doi.org/10.1109/access.2020.2991314openalex-snapshot
High-Throughput Variable-to-Fixed Entropy Codec Using Selective, Stochastic Code Forests
inferred← citeshttps://doi.org/10.1109/bigdata52589.2021.9671954openalex-snapshot
Improving Lossy Compression for SZ by Exploring the Best-Fit Lossless Compression Techniques
inferred← citeshttps://doi.org/10.1109/dcc.2015.18openalex-snapshot
Data Compression Cost Optimization
inferred← citeshttps://doi.org/10.1109/dcc.2017.74openalex-snapshot
Marlin: A High Throughput Variable-to-Fixed Codec Using Plurally Parsable Dictionaries
inferred← citeshttps://doi.org/10.1109/dcc.2018.00041openalex-snapshot
Improving Marlin's Compression Ratio with Partially Overlapping Codewords
inferred← citeshttps://doi.org/10.1109/globalsip.2014.7032133openalex-snapshot
Performance of parallel two-pass MDL context tree algorithm
inferred← citeshttps://doi.org/10.1109/jstsp.2015.2403800openalex-snapshot
A Universal Parallel Two-Pass MDL Context Tree Compression Algorithm
inferred← citeshttps://doi.org/10.1109/tnet.2015.2418296openalex-snapshot
Packet-Level Network Compression: Realization and Scaling of the Network-Wide Benefits
inferred← citeshttps://doi.org/10.1109/twc.2015.2468729openalex-snapshot
Wireless Network Compression Via Memory-Enabled Overhearing Helpers
inferred← citeshttps://doi.org/10.1145/3229710.3229715openalex-snapshot
Run-Length Base-Delta Encoding for High-Speed Compression
inferred← citeshttps://doi.org/10.1145/3579371.3589074openalex-snapshot
CDPU: Co-designing Compression and Decompression Processing Units for Hyperscale Systems
inferred← citeshttps://doi.org/10.2478/ausi-2020-0004openalex-snapshot
Word pattern prediction using Big Data frameworks
inferred← citeshttps://doi.org/10.3390/s21124223openalex-snapshot
The Deep Learning Solutions on Lossless Compression Methods for Alleviating Data Load on IoT Nodes in Smart Cities
inferred← citeshttps://doi.org/10.48550/arxiv.1811.05756openalex-snapshot
Rice-Marlin Codes: Tiny and Efficient Variable-to-Fixed Codes
inferred← citeshttps://doi.org/10.7939/r3z892x2mopenalex-snapshot
Program Analysis and Compiler Transformations for Computational Accelerators
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.