On the public citation graph
Work-time optimal parallel prefix matching
0 signed · 29 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.1006/jagm.1993.1018openalex-snapshot
Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
inferredcites →https://doi.org/10.1006/jagm.1993.1019openalex-snapshot
The Parallel Simplicity of Compaction and Chaining
inferredcites →https://doi.org/10.1007/3-540-58201-0_69openalex-snapshot
Optimal parallel algorithms for Prefix Matching
inferredcites →https://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferredcites →https://doi.org/10.1007/bfb0029793openalex-snapshot
Tight comparison bounds for the string prefix-matching problem
inferredcites →https://doi.org/10.1016/0196-6774(84)90021-xopenalex-snapshot
An O(n log n) algorithm for finding all repetitions in a string
inferredcites →https://doi.org/10.1016/s0019-9958(85)80031-0openalex-snapshot
Optimal parallel algorithms for string matching
inferredcites →https://doi.org/10.1109/sfcs.1992.267787openalex-snapshot
The complexity of parallel prefix problems on small domains
inferredcites →https://doi.org/10.1109/sfcs.1993.366862openalex-snapshot
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
inferredcites →https://doi.org/10.1137/0217037openalex-snapshot
Relations between Concurrent-Write Models of Parallel Computation
inferredcites →https://doi.org/10.1137/0219072openalex-snapshot
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
inferredcites →https://doi.org/10.1137/0220002openalex-snapshot
Deterministic Sampling–A New Technique for Fast Pattern Matching
inferredcites →https://doi.org/10.1137/0221050openalex-snapshot
A Lower Bound for Parallel String Matching
inferredcites →https://doi.org/10.1137/0222017openalex-snapshot
Recursive Star-Tree Parallel Data Structure
inferredcites →https://doi.org/10.1145/129712.129720openalex-snapshot
A constant-time optimal parallel string-matching algorithm
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.21236/ada267758openalex-snapshot
Fast Parallel String Prefix-Matching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1998.0948openalex-snapshot
On the Comparison Complexity of the String Prefix-Matching Problem
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_51openalex-snapshot
String matching in hypertext
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_11openalex-snapshot
Perfect hashing for strings: Formalization and algorithms
inferred← citeshttps://doi.org/10.1007/bfb0049433openalex-snapshot
On the exact complexity of the string prefix-matching problem
inferred← citeshttps://doi.org/10.1007/pl00009200openalex-snapshot
Two-Dimensional Prefix String Matching and Covering on Square Matrices
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00047-3openalex-snapshot
A work-time optimal algorithm for computing all string covers
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00114-3openalex-snapshot
Optimal parallel analysis and decomposition of partially occluded strings
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00162-7openalex-snapshot
Parallel two dimensional witness computation
inferred← citeshttps://doi.org/10.1145/225058.225289openalex-snapshot
Work-time-optimal parallel algorithms for string problems
inferred← citeshttps://doi.org/10.1201/9781420011296.ch30openalex-snapshot
Parallel Algorithms on Strings
inferred← citeshttps://doi.org/10.7146/brics.v2i46.19947openalex-snapshot
On the Comparison Complexity of the String Prefix-Matching Problem
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.