On the public citation graph

Constructing suffix arrays for multi-dimensional matrices

https://doi.org/10.1007/bfb0030786
0 signed · 31 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-60044-2_43openalex-snapshot
Suffix cactus: A cross between suffix tree and suffix array
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferredcites →https://doi.org/10.1007/bf01769703openalex-snapshot
Approximate string matching with suffix automata
inferredcites →https://doi.org/10.1007/bf01955677openalex-snapshot
Covering a string
inferredcites →https://doi.org/10.1016/0020-0190(81)90024-7openalex-snapshot
An optimal algorithm for computing the repetitions in a word
inferredcites →https://doi.org/10.1016/0020-0190(92)90206-bopenalex-snapshot
Two-dimensional dictionary matching
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0196-6774(89)90010-2openalex-snapshot
Fast parallel and serial approximate string matching
inferredcites →https://doi.org/10.1016/0304-3975(85)90159-8openalex-snapshot
A linear time solution to the single function coarsest partition problem
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1016/c2013-0-10982-8openalex-snapshot
Theory of Machines and Computations
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1137/0217079openalex-snapshot
On Finding Lowest Common Ancestors: Simplification and Parallelization
inferredcites →https://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferredcites →https://doi.org/10.1137/s0097539792226321openalex-snapshot
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
inferredcites →https://doi.org/10.1137/s0097539792231982openalex-snapshot
A Generalization of the Suffix Tree to Square Matrices, with Applications
inferredcites →https://doi.org/10.1137/s0097539792241941openalex-snapshot
Alphabet-Independent Two-Dimensional Witness Computation
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot
Self-adjusting binary search trees

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcom.1998.0496openalex-snapshot
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_43openalex-snapshot
Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_442openalex-snapshot
Two-Dimensional Pattern Indexing
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_442openalex-snapshot
Indexed Two-Dimensional String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_32openalex-snapshot
A Note on a Tree-Based 2D Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_442-2openalex-snapshot
Indexed Two-Dimensional String Matching
inferred← citeshttps://doi.org/10.1007/s00453-009-9350-zopenalex-snapshot
Linear-Time Construction of Two-Dimensional Suffix Trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00828-9openalex-snapshot
Generalizations of suffix arrays to multi-dimensional matrices
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00861-7openalex-snapshot
Generalizations of suffix arrays to multi-dimensional matrices
inferred← citeshttps://doi.org/10.31390/gradschool_theses.5642openalex-snapshot
2-Dimensional String Problems: Data Structures and Quantum Algorithms
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.