On the public citation graph

Reducing the Space Requirement of LZ-Index

0 signed · 56 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/11496656_5openalex-snapshot
Succinct Suffix Arrays Based on Run-Length Encoding
inferredcites →https://doi.org/10.1007/3-540-45061-0_29openalex-snapshot
Succinct Representations of Permutations
inferredcites →https://doi.org/10.1007/3-540-62034-6_35openalex-snapshot
Tables
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_84openalex-snapshot
Succinct Representations of Functions
inferredcites →https://doi.org/10.1007/978-3-540-30213-1_23openalex-snapshot
An Alphabet-Friendly FM-Index
inferredcites →https://doi.org/10.1007/s00453-004-1146-6openalex-snapshot
Representing Trees of Higher Degree
inferredcites →https://doi.org/10.1016/s0196-6774(03)00087-7openalex-snapshot
New text indexing functionalities of the compressed suffix arrays
inferredcites →https://doi.org/10.1016/s1570-8667(03)00066-2openalex-snapshot
Indexing text using the Ziv–Lempel trie
inferredcites →https://doi.org/10.1109/sfcs.2005.69openalex-snapshot
Structuring labeled trees for optimal succinctness, and beyond
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1137/0217026openalex-snapshot
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
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/s0097539797331105openalex-snapshot
Compression of Low Entropy Strings with Lempel--Ziv Algorithms
inferredcites →https://doi.org/10.1137/s0097539799364092openalex-snapshot
Succinct Representation of Balanced Parentheses and Static Trees
inferredcites →https://doi.org/10.1145/1082036.1082039openalex-snapshot
Indexing compressed text
inferredcites →https://doi.org/10.1145/1109557.1109693openalex-snapshot
Squeezing succinct data structures into entropy bounds
inferredcites →https://doi.org/10.1145/321479.321481openalex-snapshot
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
inferredcites →https://doi.org/10.1145/382780.382782openalex-snapshot
An analysis of the Burrows—Wheeler transform
inferredcites →https://doi.org/10.5555/1109557.1109693openalex-snapshot
Squeezing succinct data structures into entropy bounds
inferredcites →https://doi.org/10.5555/545381.545411openalex-snapshot
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
inferredcites →https://doi.org/10.5555/644108.644250openalex-snapshot
High-order entropy-compressed text indexes
inferredcites →https://doi.org/10.5555/982792.982794openalex-snapshot
Succinct ordinal trees with level-ancestor queries

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.2227openalex-snapshot
Fast in‐memory XPath search using compressed indexes
inferred← citeshttps://doi.org/10.1007/11880561_14openalex-snapshot
A Compressed Self-index Using a Ziv-Lempel Dictionary
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_108openalex-snapshot
Dictionary-Based Data Compression
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_1144openalex-snapshot
Indexing Compressed Text
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_108openalex-snapshot
Dictionary-Based Data Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-59826-0_1openalex-snapshot
Algorithms for Indexing Highly Similar DNA Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_11openalex-snapshot
A Lempel-Ziv Text Index on Secondary Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_24openalex-snapshot
Approximate String Matching with Lempel-Ziv Compressed Indexes
inferred← citeshttps://doi.org/10.1007/978-3-540-89097-3_13openalex-snapshot
Self-indexing Natural Language
inferred← citeshttps://doi.org/10.1007/978-3-540-89097-3_17openalex-snapshot
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_21openalex-snapshot
Self-indexed Text Compression Using Straight-Line Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_27openalex-snapshot
Fast Relative Lempel-Ziv Self-index for Similar Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_19openalex-snapshot
Improved Grammar-Based Compressed Indexes
inferred← citeshttps://doi.org/10.1007/s00453-010-9443-8openalex-snapshot
Stronger Lempel-Ziv Based Compressed Text Indexing
inferred← citeshttps://doi.org/10.1007/s10791-008-9050-3openalex-snapshot
A compressed self-index using a Ziv–Lempel dictionary
inferred← citeshttps://doi.org/10.1016/j.ic.2011.03.001openalex-snapshot
Space-efficient construction of Lempel–Ziv compressed text indexes
inferred← citeshttps://doi.org/10.1016/j.jda.2012.07.009openalex-snapshot
ESP-index: A compressed index based on edit-sensitive parsing
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.006openalex-snapshot
On compressing and indexing repetitive sequences
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.024openalex-snapshot
Fast relative Lempel–Ziv self-index for similar sequences
inferred← citeshttps://doi.org/10.1093/bioinformatics/btx596openalex-snapshot
FMtree: a fast locating algorithm of FM-indexes for genomic data
inferred← citeshttps://doi.org/10.1109/icde.2010.5447858openalex-snapshot
Fast in-memory XPath search using compressed indexes
inferred← citeshttps://doi.org/10.1145/1216370.1216372openalex-snapshot
Compressed full-text indexes
inferred← citeshttps://doi.org/10.1145/1412228.1412230openalex-snapshot
Implementing the LZ-index
inferred← citeshttps://doi.org/10.1145/1412228.1455268openalex-snapshot
Compressed text indexes
inferred← citeshttps://doi.org/10.1145/1613676.1613680openalex-snapshot
Compressing and indexing labeled trees, with applications
inferred← citeshttps://doi.org/10.1145/1671970.1883684openalex-snapshot
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices
inferred← citeshttps://doi.org/10.1145/1877766.1877768openalex-snapshot
Engineering basic algorithms of an in-memory text search engine
inferred← citeshttps://doi.org/10.3233/fi-2011-565openalex-snapshot
Self-Indexed Grammar-Based Compression
inferred← citeshttps://doi.org/10.3390/a2031105openalex-snapshot
Approximate String Matching with Compressed Indexes
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1814openalex-snapshot
Compressed Representations of Permutations, and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.0712.3360openalex-snapshot
Compressed Text Indexes:From Theory to Practice!
inferred← citeshttps://doi.org/10.48550/arxiv.0907.2089openalex-snapshot
Fast In-Memory XPath Search over Compressed Text and Tree Indexes
inferred← citeshttps://doi.org/10.48550/arxiv.1101.4065openalex-snapshot
Self-Index Based on LZ77
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4493openalex-snapshot
Improved Grammar-Based Compressed Indexes
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.