On the public citation graph
Lempel-Ziv Parsing in External Memory
0 signed · 32 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.1002/spe.844openalex-snapshot
S TXXL : standard template library for XXL data sets
inferredcites →https://doi.org/10.1007/978-3-642-21458-5_6openalex-snapshot
Self-indexing Based on LZ77
inferredcites →https://doi.org/10.1007/978-3-642-25591-5_67openalex-snapshot
Faster Approximate Pattern Matching in Compressed Repetitive Texts
inferredcites →https://doi.org/10.1007/978-3-642-33090-2_17openalex-snapshot
New Lower and Upper Bounds for Representing Sequences
inferredcites →https://doi.org/10.1007/978-3-642-38527-8_14openalex-snapshot
Lightweight Lempel-Ziv Parsing
inferredcites →https://doi.org/10.1007/978-3-642-38905-4_19openalex-snapshot
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
inferredcites →https://doi.org/10.1007/s00453-011-9535-0openalex-snapshot
Lightweight Data Indexing and Compression in External Memory
inferredcites →https://doi.org/10.1016/0304-3975(92)90134-2openalex-snapshot
String-matching on ordered alphabets
inferredcites →https://doi.org/10.1109/dcc.2008.36openalex-snapshot
A Simple Algorithm for Computing the Lempel Ziv Factorization
inferredcites →https://doi.org/10.1109/dcc.2013.20openalex-snapshot
Practical Parallel Lempel-Ziv Factorization
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/1.9781611972931.8openalex-snapshot
Inducing Suffix and LCP Arrays in External Memory
inferredcites →https://doi.org/10.1145/1718487.1718536openalex-snapshot
On compressing the textual web
inferredcites →https://doi.org/10.1145/2379776.2379781openalex-snapshot
A comparison of index-based lempel-Ziv LZ77 factorization algorithms
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-32686-9_3openalex-snapshot
Rpair: Rescaling RePair with Rsync
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_14openalex-snapshot
Scalable Text Index Construction
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_14openalex-snapshot
Sublinear Time Lempel-Ziv (LZ77) Factorization
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_15openalex-snapshot
New Advances in Rightmost Lempel-Ziv
inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_35openalex-snapshot
LCP Array Construction in External Memory
inferred← citeshttps://doi.org/10.1007/978-3-319-19929-0_28openalex-snapshot
Parallel External Memory Suffix Sorting
inferred← citeshttps://doi.org/10.1007/978-3-319-38851-9_22openalex-snapshot
CHICO: A Compressed Hybrid Index for Repetitive Collections
inferred← citeshttps://doi.org/10.1007/978-3-319-38851-9_5openalex-snapshot
Lempel-Ziv Decoding in External Memory
inferred← citeshttps://doi.org/10.1007/978-3-319-46049-9_16openalex-snapshot
Analyzing Relative Lempel-Ziv Reference Construction
inferred← citeshttps://doi.org/10.1007/s00453-018-0475-9openalex-snapshot
Fixed Block Compression Boosting in FM-Indexes: Theory and Practice
inferred← citeshttps://doi.org/10.1007/s00453-020-00722-6openalex-snapshot
Lempel–Ziv-Like Parsing in Small Space
inferred← citeshttps://doi.org/10.1007/s11786-016-0281-1openalex-snapshot
Engineering a Lightweight External Memory Suffix Array Construction Algorithm
inferred← citeshttps://doi.org/10.1109/dcc.2017.73openalex-snapshot
LZ-End Parsing in Compressed Space
inferred← citeshttps://doi.org/10.1145/2851491openalex-snapshot
LCP Array Construction in External Memory
inferred← citeshttps://doi.org/10.1145/3717823.3718291openalex-snapshot
On the Hardness Hierarchy for the 𝑂(𝑛 √log 𝑛) Complexity in the Word RAM
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.