On the public citation graph
Sparse Text Indexing in Small Space
0 signed · 39 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.1007/11780441_7openalex-snapshot
On-Line Linear-Time Construction of Word Suffix Trees
inferredcites →https://doi.org/10.1007/3-540-44888-8_5openalex-snapshot
Fast Lightweight Suffix Array Construction and Checking
inferredcites →https://doi.org/10.1007/3-540-48194-x_17openalex-snapshot
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
inferredcites →https://doi.org/10.1007/978-3-642-21458-5_22openalex-snapshot
Sparse and Truncated Suffix Trees on Variable-Length Codes
inferredcites →https://doi.org/10.1007/978-3-662-49529-2_36openalex-snapshot
Deterministic Sparse Suffix Sorting on Rewritable Texts
inferredcites →https://doi.org/10.1007/bf01840378openalex-snapshot
Improved sorting networks withO(logN) depth
inferredcites →https://doi.org/10.1016/0020-0190(83)90075-3openalex-snapshot
Log-logarithmic worst-case range queries are possible in space Θ(N)
inferredcites →https://doi.org/10.1016/0304-3975(91)90073-bopenalex-snapshot
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
inferredcites →https://doi.org/10.1016/j.jda.2010.12.001openalex-snapshot
Position heaps: A simple and dynamic text indexing data structure
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0174934-9openalex-snapshot
Uniqueness Theorems for Periodic Functions
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/ccp.2011.45openalex-snapshot
Pattern Matching on Sparse Suffix Trees
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/321479.321481openalex-snapshot
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
inferredcites →https://doi.org/10.1145/800152.804905openalex-snapshot
Rapid identification of repeated patterns in strings, trees and arrays
inferredcites →https://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms
inferredcites →https://doi.org/10.4230/lipics.stacs.2014.386openalex-snapshot
Faster Sparse Suffix Sorting
inferredcites →https://doi.org/10.5555/314161.314321openalex-snapshot
Fast algorithms for sorting and searching strings
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-86692-1_12openalex-snapshot
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_11openalex-snapshot
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
inferred← citeshttps://doi.org/10.1007/s00454-016-9811-5openalex-snapshot
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes
inferred← citeshttps://doi.org/10.1007/s10489-020-01778-1openalex-snapshot
NetDAP: (δ, γ) −approximate pattern matching with length constraints
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106067openalex-snapshot
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph
inferred← citeshttps://doi.org/10.1016/j.ipm.2024.103777openalex-snapshot
Algorithm design and performance evaluation of sparse induced suffix sorting
inferred← citeshttps://doi.org/10.1017/9781108539180openalex-snapshot
Forbidden Configurations in Discrete Geometry
inferred← citeshttps://doi.org/10.1109/access.2018.2832209openalex-snapshot
NETASPNO: Approximate Strict Pattern Matching Under Nonoverlapping Condition
inferred← citeshttps://doi.org/10.1137/1.9781611975994.37openalex-snapshot
Locally Consistent Parsing for Text Indexing in Small Space
inferred← citeshttps://doi.org/10.1137/21m1465706openalex-snapshot
Locally Consistent Parsing for Text Indexing in Small Space
inferred← citeshttps://doi.org/10.1145/3426870openalex-snapshot
Optimal Substring Equality Queries with Applications to Sparse Text Indexing
inferred← citeshttps://doi.org/10.1145/3448016.3457290openalex-snapshot
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2024.20openalex-snapshot
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2020.14openalex-snapshot
Space Efficient Construction of Lyndon Arrays in Linear Time
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.