On the public citation graph
Binary Codes for Non-Uniform Sources
0 signed · 29 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.1007/978-1-4615-0935-6openalex-snapshot
Compression and Coding Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-39984-1_10openalex-snapshot
(S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_12openalex-snapshot
Novel Compression of Sparse Bit-Strings — Preliminary Report
inferredcites →https://doi.org/10.1023/a:1013002601898openalex-snapshot
Binary Interpolative Coding for Effective Index Compression
inferredcites →https://doi.org/10.1023/b:inrt.0000048490.99518.5copenalex-snapshot
Inverted Index Compression Using Word-Aligned Binary Codes
inferredcites →https://doi.org/10.1093/comjnl/39.9.731openalex-snapshot
The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and Improvements
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.1966.1053907openalex-snapshot
Run-length encodings (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1145/348751.348754openalex-snapshot
Fast and flexible word searching on compressed text
inferredcites →https://doi.org/10.1145/564376.564416openalex-snapshot
Compression of inverted indexes For fast query evaluation
inferredcites →https://doi.org/10.1145/564414.564416openalex-snapshot
Compression of inverted indexes For fast query evaluation
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-63962-8_52-2openalex-snapshot
Inverted Index Compression
inferred← citeshttps://doi.org/10.1007/s10707-012-0171-xopenalex-snapshot
HFPaC: GPU friendly height field parallel compression
inferred← citeshttps://doi.org/10.1016/j.cageo.2017.11.003openalex-snapshot
2D-RBUC for efficient parallel compression of residuals
inferred← citeshttps://doi.org/10.1093/comjnl/bxn030openalex-snapshot
Tournament Coding of Integer Sequences
inferred← citeshttps://doi.org/10.1109/3dtv.2016.7548892openalex-snapshot
GPU-based lossless volume data compression
inferred← citeshttps://doi.org/10.1109/dcc.2010.53openalex-snapshot
Inverted Index Compression for Scalable Image Matching
inferred← citeshttps://doi.org/10.1109/telfor.2013.6716388openalex-snapshot
Fast CUDA-based codec for height fields
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2011.01989.xopenalex-snapshot
Variable Bit Rate GPU Texture Decompression
inferred← citeshttps://doi.org/10.1145/1730804.1730815openalex-snapshot
On-the-fly decompression and rendering of multiresolution terrain
inferred← citeshttps://doi.org/10.1145/2348283.2348317openalex-snapshot
Efficient in-memory top-k document retrieval
inferred← citeshttps://doi.org/10.1145/3415148openalex-snapshot
Techniques for Inverted Index Compression
inferred← citeshttps://doi.org/10.2298/bg20130424djurdjevicopenalex-snapshot
Efficient parallel compression of height fields
inferred← citeshttps://doi.org/10.2312/vmv.20161345openalex-snapshot
Variable Length Coding for GPU-Based Direct Volume Rendering
inferred← citeshttps://doi.org/10.25439/rmt.27354450openalex-snapshot
Scalable succinct indexing for large text collections
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.