On the public citation graph

Lempel-Ziv Computation in Compressed Space (LZ-CICS)

https://doi.org/10.1109/dcc.2016.38
0 signed · 34 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.1007/978-3-319-19929-0_14openalex-snapshot
Alphabet-Dependent String Searching with Wexponential Search Trees
inferredcites →https://doi.org/10.1007/978-3-319-19929-0_15openalex-snapshot
Lempel Ziv Computation in Small Space (LZ-CISS)
inferredcites →https://doi.org/10.1007/978-3-540-75520-3_19openalex-snapshot
Radix Sorting with No Extra Space
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-662-48054-0_36openalex-snapshot
Faster Lightweight Lempel-Ziv Parsing
inferredcites →https://doi.org/10.1007/s00224-006-1198-xopenalex-snapshot
Compressed Suffix Trees with Full Functionality
inferredcites →https://doi.org/10.1007/s00453-013-9836-6openalex-snapshot
Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space
inferredcites →https://doi.org/10.1016/j.ipl.2015.04.002openalex-snapshot
Constructing LZ78 tries and position heaps in linear time for large alphabets
inferredcites →https://doi.org/10.1109/dcc.2013.50openalex-snapshot
The Rightmost Equal-Cost Position Problem
inferredcites →https://doi.org/10.1109/sfcs.1989.63533openalex-snapshot
Space-efficient static trees and graphs
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1137/1.9781611974331.ch143openalex-snapshot
Range Predecessor and Lempel-Ziv Parsing
inferredcites →https://doi.org/10.1137/120869511openalex-snapshot
On the Bit-Complexity of Lempel--Ziv Compression
inferredcites →https://doi.org/10.1137/s0097539702402354openalex-snapshot
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferredcites →https://doi.org/10.1145/1290672.1290680openalex-snapshot
Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
inferredcites →https://doi.org/10.1145/2591796.2591885openalex-snapshot
Linear time construction of compressed text indices in compact space
inferredcites →https://doi.org/10.1145/2601073openalex-snapshot
Fully Functional Static and Dynamic Succinct Trees
inferredcites →https://doi.org/10.5555/1109557.1109693openalex-snapshot
Squeezing succinct data structures into entropy bounds

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-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-67428-5_16openalex-snapshot
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_4openalex-snapshot
LZ78 Compression in Low Main Memory Space
inferred← citeshttps://doi.org/10.1007/s00453-017-0333-1openalex-snapshot
Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees
inferred← citeshttps://doi.org/10.1007/s12652-017-0540-2openalex-snapshot
An optimal text compression algorithm based on frequent pattern mining
inferred← citeshttps://doi.org/10.1016/j.dam.2019.01.014openalex-snapshot
Dynamic index and LZ factorization in compressed space
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.014openalex-snapshot
Recent Trends
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00122openalex-snapshot
Lempel-Ziv (LZ77) Factorization in Sublinear Time
inferred← citeshttps://doi.org/10.1145/3432999openalex-snapshot
Indexing Highly Repetitive String Collections, Part II
inferred← citeshttps://doi.org/10.1145/3481638openalex-snapshot
Engineering Practical Lempel-Ziv Tries
inferred← citeshttps://doi.org/10.3390/en16248077openalex-snapshot
Compression Techniques for Real-Time Control and Non-Time-Critical Big Data in Smart Grids: A Review
inferred← citeshttps://doi.org/10.48550/arxiv.2004.02781openalex-snapshot
Indexing Highly Repetitive String Collections
inferred← citeshttps://doi.org/10.5334/dsj-2018-012openalex-snapshot
Text and Image Compression based on Data Mining Perspective
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.