On the public citation graph

I/O-Efficient Compressed Text Indexes: From Theory to Practice

0 signed · 38 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/11682462_64openalex-snapshot
Position-Restricted Substring Searching
inferredcites →https://doi.org/10.1007/3-540-49257-7_17openalex-snapshot
Optimal Dynamic Range Searching inNon-replicating Index Structures
inferredcites →https://doi.org/10.1007/978-3-540-73437-6_11openalex-snapshot
A Lempel-Ziv Text Index on Secondary Storage
inferredcites →https://doi.org/10.1016/b978-012088469-8.50007-3openalex-snapshot
Practical Suffix Tree Construction
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferredcites →https://doi.org/10.1109/dcc.2008.67openalex-snapshot
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
inferredcites →https://doi.org/10.1109/icde.2004.1320040openalex-snapshot
Engineering a fast online persistent suffix tree construction
inferredcites →https://doi.org/10.1109/sfcs.2005.69openalex-snapshot
Structuring labeled trees for optimal succinctness, and beyond
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
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/s009753970240481xopenalex-snapshot
Optimal External Memory Interval Management
inferredcites →https://doi.org/10.1145/1082036.1082039openalex-snapshot
Indexing compressed text
inferredcites →https://doi.org/10.1145/1216370.1216372openalex-snapshot
Compressed full-text indexes
inferredcites →https://doi.org/10.1145/1240233.1240243openalex-snapshot
Compressed representations of sequences and full-text indexes
inferredcites →https://doi.org/10.1145/1328911.1328920openalex-snapshot
The priority R-tree
inferredcites →https://doi.org/10.1145/1376616.1376683openalex-snapshot
Improving suffix array locality for fast pattern matching on disk
inferredcites →https://doi.org/10.1145/263661.263688openalex-snapshot
On the analysis of indexing schemes
inferredcites →https://doi.org/10.1145/301970.301973openalex-snapshot
The string B-tree
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/77600.77614openalex-snapshot
Lower bounds for orthogonal range searching: I. The reporting case
inferredcites →https://doi.org/10.5555/644108.644250openalex-snapshot
High-order entropy-compressed text indexes

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-642-13509-5_24openalex-snapshot
Compression, Indexing, and Retrieval for Massive String Data
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_33openalex-snapshot
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
inferred← citeshttps://doi.org/10.1007/978-3-642-15781-3_1openalex-snapshot
Data Structures: Time, I/Os, Entropy, Joules!
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2openalex-snapshot
Mathematical Foundations of Computer Science 2012
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_68openalex-snapshot
Computing Lempel-Ziv Factorization Online
inferred← citeshttps://doi.org/10.1007/s00453-013-9792-1openalex-snapshot
Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching
inferred← citeshttps://doi.org/10.1017/cbo9781316588284.014openalex-snapshot
Recent Trends
inferred← citeshttps://doi.org/10.1109/ccp.2011.45openalex-snapshot
Pattern Matching on Sparse Suffix Trees
inferred← citeshttps://doi.org/10.1109/dcc.2018.00030openalex-snapshot
Practical Succinct Text Indexes in External Memory
inferred← citeshttps://doi.org/10.1137/1.9781611972924.7openalex-snapshot
Fast Compressed Tries through Path Decompositions
inferred← citeshttps://doi.org/10.1145/2656332openalex-snapshot
Fast Compressed Tries through Path Decompositions
inferred← citeshttps://doi.org/10.2298/csis110606004mopenalex-snapshot
Wavelet trees: A survey
inferred← citeshttps://doi.org/10.3233/ida-205087openalex-snapshot
Suffix array for multi-pattern matching with variable length wildcards
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.