On the public citation graph
Improvements on Re-Pair Grammar Compressor
0 signed · 22 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-3-540-73437-6_23openalex-snapshot
Compressed Text Indexes with Fast Locate
inferredcites →https://doi.org/10.1007/978-3-540-75530-2_11openalex-snapshot
A Fast and Compact Web Graph Representation
inferredcites →https://doi.org/10.1016/j.is.2013.06.006openalex-snapshot
XML tree structure compression using RePair
inferredcites →https://doi.org/10.1016/j.tcs.2009.09.012openalex-snapshot
Faster entropy-bounded compressed suffix trees
inferredcites →https://doi.org/10.1016/j.tcs.2015.12.032openalex-snapshot
A really simple approximation of smallest grammar
inferredcites →https://doi.org/10.1016/s0304-3975(02)00777-6openalex-snapshot
Application of Lempel–Ziv factorization to the approximation of grammar-based compression
inferredcites →https://doi.org/10.1109/5.892708openalex-snapshot
Off-line dictionary-based compression
inferredcites →https://doi.org/10.1109/dcc.2008.79openalex-snapshot
Re-pair Achieves High-Order Entropy
inferredcites →https://doi.org/10.1515/gcc-2012-0016openalex-snapshot
Algorithmics on SLP-compressed strings: A survey
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-030-59212-7_16openalex-snapshot
Practical Random Access to SLP-Compressed Texts
inferred← citeshttps://doi.org/10.1007/978-981-16-4095-7_7openalex-snapshot
Compression and Pattern Matching
inferred← citeshttps://doi.org/10.1007/s00778-020-00636-3openalex-snapshot
TADOC: Text analytics directly on compression
inferred← citeshttps://doi.org/10.1016/j.ins.2022.08.054openalex-snapshot
A new algorithm for compression of partially commutative alphabets
inferred← citeshttps://doi.org/10.1109/dcc.2019.00059openalex-snapshot
MR-RePair: Grammar Compression Based on Maximal Repeats
inferred← citeshttps://doi.org/10.1109/dcc.2019.00060openalex-snapshot
RePair in Compressed Space and Time
inferred← citeshttps://doi.org/10.1109/tit.2020.3038147openalex-snapshot
The Smallest Grammar Problem Revisited
inferred← citeshttps://doi.org/10.1145/3399666.3399931openalex-snapshot
Accelerating re-pair compression using FPGAs
inferred← citeshttps://doi.org/10.1145/3626765openalex-snapshot
Homomorphic Compression: Making Text Processing on Compression Unlimited
inferred← citeshttps://doi.org/10.3390/a13040103openalex-snapshot
Practical Grammar Compression Based on Maximal Repeats
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.