On the public citation graph

Compressing Sets and Multisets of Sequences

0 signed · 33 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.1016/0020-0190(78)90024-8openalex-snapshot
A compression method for clustered bit-vectors
inferredcites →https://doi.org/10.1016/0304-3975(80)90073-0openalex-snapshot
Lexicographic generation of ordered trees
inferredcites →https://doi.org/10.1093/comjnl/40.2_and_3.157openalex-snapshot
Efficient Stochastic Source Coding and an Application to a Bayesian Network Source Model
inferredcites →https://doi.org/10.1109/dcc.2006.78openalex-snapshot
Toward a Source Coding Theory for Sets
inferredcites →https://doi.org/10.1109/dcc.2011.12openalex-snapshot
Coding of Sets of Words
inferredcites →https://doi.org/10.1109/ita.2007.4357578openalex-snapshot
On Universal Coding of Unordered Data
inferredcites →https://doi.org/10.1109/itw.2012.6404756openalex-snapshot
Compressing multisets using tries
inferredcites →https://doi.org/10.1109/tit.1965.1053772openalex-snapshot
Fibonacci codes for synchronization control
inferredcites →https://doi.org/10.1109/tit.1973.1054929openalex-snapshot
Enumerative source encoding
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1109/tit.1987.1057284openalex-snapshot
Robust transmission of unbounded strings using Fibonacci representations
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s11760-025-04049-zopenalex-snapshot
Distributed coding with sorting and assignment
inferred← citeshttps://doi.org/10.1038/s41467-017-02480-6openalex-snapshot
Optimal compressed representation of high throughput sequence data via light assembly
inferred← citeshttps://doi.org/10.1049/iet-com.2016.0202openalex-snapshot
Joint source–channel coding for band‐limited backhauls in coordinated multi‐point systems
inferred← citeshttps://doi.org/10.1080/00927872.2019.1710164openalex-snapshot
Identities of the Kauffman monoid K3
inferred← citeshttps://doi.org/10.1093/bioinformatics/btv071openalex-snapshot
Reference-based compression of short-read sequences using path encoding
inferred← citeshttps://doi.org/10.1109/dcc.2017.60openalex-snapshot
Universal Source Coding of Deep Neural Networks
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00061openalex-snapshot
The Twelvefold Way of Non-Sequential Lossless Compression
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00040openalex-snapshot
Compressing Multisets with Large Alphabets
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413447openalex-snapshot
Predictive Coding for Lossless Dataset Compression
inferred← citeshttps://doi.org/10.1109/isit.2018.8437551openalex-snapshot
Coding of Graphs with Application to Graph Anomaly Detection
inferred← citeshttps://doi.org/10.1109/jsait.2023.3245417openalex-snapshot
Compressing Multisets With Large Alphabets
inferred← citeshttps://doi.org/10.1109/jsait.2023.3261819openalex-snapshot
Universal and Succinct Source Coding of Deep Neural Networks
inferred← citeshttps://doi.org/10.1109/spcom.2016.7746651openalex-snapshot
Text compression using lexicographic permutation of binary strings
inferred← citeshttps://doi.org/10.1109/tit.2017.2789292openalex-snapshot
Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
inferred← citeshttps://doi.org/10.1109/tit.2018.2829161openalex-snapshot
Rate-Distortion Theory of Finite Point Processes
inferred← citeshttps://doi.org/10.1145/3711896.3737034openalex-snapshot
Lossless Set Compression by Binary Tree Coding
inferred← citeshttps://doi.org/10.33411/ijist/849openalex-snapshot
The Exploring Political Emotions Sentiment Analysis of Urdu Tweets
inferred← citeshttps://doi.org/10.3390/a16030170openalex-snapshot
Multiset-Trie Data Structure
inferred← citeshttps://doi.org/10.48550/arxiv.1901.01564openalex-snapshot
Identities of the Kauffman Monoid $\mathcal{K}_3$
inferred← citeshttps://doi.org/10.48550/arxiv.1908.05415openalex-snapshot
"LOADS of Space": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes
inferred← citeshttps://doi.org/10.48550/arxiv.2110.00701openalex-snapshot
Graph Compression with Application to Model Selection
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.