On the public citation graph

Non-Overlapping Indexing in Bwt-Runs Bounded Space

https://doi.org/10.2139/ssrn.4809476
0 signed · 24 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-030-67731-2_18openalex-extracted
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
inferredcites →https://doi.org/10.1007/978-3-031-43980-3_21openalex-extracted
Non-overlapping Indexing in BWT-Runs Bounded Space
inferredcites →https://doi.org/10.1007/978-3-319-19929-0_16openalex-extracted
Succinct Non-overlapping Indexing
inferredcites →https://doi.org/10.1007/978-3-540-73951-7_54openalex-extracted
Range Non-overlapping Indexing and Successive List Indexing
inferredcites →https://doi.org/10.1007/978-3-642-10631-6_105openalex-extracted
Range Non-overlapping Indexing
inferredcites →https://doi.org/10.1007/s00453-012-9618-6openalex-extracted
Sublinear Algorithms for Approximating String Compressibility
inferredcites →https://doi.org/10.1007/s00453-019-00605-5openalex-extracted
Succinct Non-overlapping Indexing
inferredcites →https://doi.org/10.1016/0304-3975(92)90134-2openalex-extracted
String-matching on ordered alphabets
inferredcites →https://doi.org/10.1016/j.tcs.2019.08.005openalex-extracted
Refining the r-index
inferredcites →https://doi.org/10.1109/focs46700.2020.00097openalex-extracted
Resolution of the Burrows-Wheeler Transform Conjecture
inferredcites →https://doi.org/10.1109/focs57990.2023.00114openalex-extracted
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-extracted
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1109/tit.2022.3224382openalex-extracted
Toward a Definitive Compressibility Measure for Repetitive Sequences
inferredcites →https://doi.org/10.1137/0222058openalex-extracted
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/1.9781611975031.96openalex-extracted
Optimal-Time Text Indexing in BWT-runs Bounded Space
inferredcites →https://doi.org/10.1137/s0097539702402354openalex-extracted
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
inferredcites →https://doi.org/10.1145/1082036.1082039openalex-extracted
Indexing compressed text
inferredcites →https://doi.org/10.1145/1216370.1216372openalex-extracted
Compressed full-text indexes
inferredcites →https://doi.org/10.1145/1290672.1290680openalex-extracted
Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
inferredcites →https://doi.org/10.1145/3375890openalex-extracted
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
inferredcites →https://doi.org/10.1145/380752.380842openalex-extracted
Optimal static range reporting in one dimension
inferredcites →https://doi.org/10.4230/lipics.cpm.2018.8openalex-extracted
Non-Overlapping Indexing - Cache Obliviously
inferredcites →https://doi.org/10.4230/lipics.cpm.2021.13openalex-extracted
A Fast and Small Subsampled R-Index
inferredcites →https://doi.org/10.4230/lipics.cpm.2021.8openalex-extracted
Weighted Ancestors in Suffix Trees Revisited
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.