On the public citation graph

Towards Real-Time Suffix Tree Construction

0 signed · 35 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/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-45061-0_73openalex-snapshot
Simple Linear Work Suffix Array Construction
inferredcites →https://doi.org/10.1007/3-540-45749-6openalex-snapshot
Algorithms — ESA 2002
inferredcites →https://doi.org/10.1007/3-540-45749-6_17openalex-snapshot
Two Simplified Algorithms for Maintaining Order in a List
inferredcites →https://doi.org/10.1007/3-540-48523-6_34openalex-snapshot
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_52openalex-snapshot
A General Technique for Managing Strings in Comparison-Driven Data Structures
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1109/sfcs.1996.548491openalex-snapshot
Efficient approximate and dynamic matching of patterns using a labeling paradigm
inferredcites →https://doi.org/10.1109/sfcs.1997.646102openalex-snapshot
Optimal suffix tree construction with large alphabets
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/s0097539700370539openalex-snapshot
Dynamic LCA Queries on Trees
inferredcites →https://doi.org/10.1145/28395.28434openalex-snapshot
Two algorithms for maintaining order in a list
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.5555/320176.320218openalex-snapshot
Suffix arrays: a new method for on-line string searches
inferredcites →https://doi.org/10.5555/338219.338645openalex-snapshot
Pattern matching in dynamic texts

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11786986_32openalex-snapshot
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_414openalex-snapshot
Suffix Tree Construction in RAM
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_422openalex-snapshot
Text Indexing
inferred← citeshttps://doi.org/10.1007/978-3-030-00479-8_20openalex-snapshot
Searching for a Modified Pattern in a Changing Text
inferred← citeshttps://doi.org/10.1007/978-3-032-05228-5_17openalex-snapshot
String Matching with a Dynamic Pattern
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_5openalex-snapshot
On Demand String Sorting over Unbounded Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_16openalex-snapshot
Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_8openalex-snapshot
Persistency in Suffix Trees with Applications to String Interval Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_414-2openalex-snapshot
Suffix Tree Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_55openalex-snapshot
Full-Fledged Real-Time Indexing for Constant Size Alphabets
inferred← citeshttps://doi.org/10.1007/s00453-013-9860-6openalex-snapshot
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing
inferred← citeshttps://doi.org/10.1007/s00453-016-0199-7openalex-snapshot
Full-Fledged Real-Time Indexing for Constant Size Alphabets
inferred← citeshttps://doi.org/10.1016/j.jda.2012.07.003openalex-snapshot
Near real-time suffix tree construction via the fringe marked ancestor problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.001openalex-snapshot
On demand string sorting over unbounded alphabets
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.023openalex-snapshot
Towards a real time algorithm for parameterized longest common prefix computation
inferred← citeshttps://doi.org/10.1109/focs.2012.79openalex-snapshot
On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List
inferred← citeshttps://doi.org/10.1137/110836377openalex-snapshot
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing
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.