On the public citation graph
Optimal parallel pattern matching in strings
0 signed · 174 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/bfb0036940openalex-snapshot
Parallel dictionaries on 2–3 trees
inferredcites →https://doi.org/10.1007/bfb0105127openalex-snapshot
Finding the maximum, merging and sorting in a parallel computation model
inferredcites →https://doi.org/10.1007/bfb0105130openalex-snapshot
Parallel algorithms for the convex hull problem in two dimensions
inferredcites →https://doi.org/10.1016/0020-0190(84)90128-5openalex-snapshot
An optimal algorithm for parallel selection
inferredcites →https://doi.org/10.1016/0020-0190(85)90025-0openalex-snapshot
On efficient parallel strong orientation
inferredcites →https://doi.org/10.1016/0022-0000(84)90003-5openalex-snapshot
Finding Euler tours in parallel
inferredcites →https://doi.org/10.1016/0166-218x(84)90019-2openalex-snapshot
An optimal parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/0196-6774(82)90013-xopenalex-snapshot
An O(n2log n) parallel max-flow algorithm
inferredcites →https://doi.org/10.1109/sfcs.1981.6openalex-snapshot
A fast probabilistic parallel sorting algorithm
inferredcites →https://doi.org/10.1109/sfcs.1985.22openalex-snapshot
Efficient string matching in the presence of errors
inferredcites →https://doi.org/10.1137/0207043openalex-snapshot
A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
inferredcites →https://doi.org/10.1137/0210051openalex-snapshot
Fast, Efficient Parallel Algorithms for Some Graph Problems
inferredcites →https://doi.org/10.1137/0213036openalex-snapshot
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/1020096openalex-snapshot
A Survey of Parallel Algorithms in Numerical Linear Algebra
inferredcites →https://doi.org/10.1145/3318.3478openalex-snapshot
Optimal parallel generation of a computation tree form
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/800057.808686openalex-snapshot
Randomized speed-ups in parallel computation
inferredcites →https://doi.org/10.1145/800057.808687openalex-snapshot
Optimal parallel algorithms for string matching
inferredcites →https://doi.org/10.1145/800057.808688openalex-snapshot
Finding euler circuits in logarithmic parallel time
inferredcites →https://doi.org/10.1145/800061.808727openalex-snapshot
A logarithmic time sort for linear size networks
inferredcites →https://doi.org/10.1145/800222.806745openalex-snapshot
Relations between concurrent-write models of parallel computation
inferredcites →https://doi.org/10.1307/mmj/1028998766openalex-snapshot
The equation $a^M=b^Nc^P$ in a free group.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/scj.4690240503openalex-snapshot
A parallel algorithm for tree pattern matching
inferred← citeshttps://doi.org/10.1006/inco.1998.2705openalex-snapshot
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM
inferred← citeshttps://doi.org/10.1006/jagm.1997.0860openalex-snapshot
Optimal Two-Dimensional Compressed Matching
inferred← citeshttps://doi.org/10.1007/11496656_23openalex-snapshot
Two Dimensional Parameterized Matching
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_23openalex-snapshot
Optimal speedups for parallel pattern matching in trees
inferred← citeshttps://doi.org/10.1007/3-540-18099-0_39openalex-snapshot
A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
inferred← citeshttps://doi.org/10.1007/3-540-45123-4_34openalex-snapshot
On the Complexity of Determining the Period of a String
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_72openalex-snapshot
Constant-space string-matching
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_36openalex-snapshot
Parallel computations on strings and arrays
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_148openalex-snapshot
Structural parallel algorithmics
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_82openalex-snapshot
Optimal parallel algorithms for periods, palindromes and squares
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_81openalex-snapshot
Algorithms for determining the geometrical congruity in two and three dimensions
inferred← citeshttps://doi.org/10.1007/3-540-56346-6_33openalex-snapshot
Note on two-dimensional pattern matching by optimal parallel algorithms
inferred← citeshttps://doi.org/10.1007/3-540-56625-2_21openalex-snapshot
Derivation of a parallel matching algorithm
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_143openalex-snapshot
Optimal pattern matching on meshes
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_3openalex-snapshot
On a parallel-algorithms method for string matching problems (overview)
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_11openalex-snapshot
An alphabet-independent optimal parallel search for three dimensional pattern
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_12openalex-snapshot
Unit route upper bound for string-matching on hypercube
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_70openalex-snapshot
Optimal two-dimensional compressed matching
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_91openalex-snapshot
On linear-time alphabet-independent 2-dimensional pattern matching
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_32openalex-snapshot
Efficient string matching on coded texts
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_51openalex-snapshot
String matching in hypertext
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_110openalex-snapshot
Distributed string matching algorithm on the N-cube
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_246openalex-snapshot
Multidimensional Compressed Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_444openalex-snapshot
Two-Dimensional Scaled Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_1openalex-snapshot
Fast Parallel and Serial Multidimensional Approximate Array Matching
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_3openalex-snapshot
Constant-Space String-Matching
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_4openalex-snapshot
Matching Patterns in Strings Subject to Multi-Linear Transformations
inferred← citeshttps://doi.org/10.1007/978-1-4613-1007-5_6openalex-snapshot
Pattern Matching in Strings
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_10openalex-snapshot
Parallel string matching algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_21openalex-snapshot
Optimal Parallel Pattern Matching Through Randomization
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_246openalex-snapshot
Multidimensional Compressed Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_444openalex-snapshot
Two-Dimensional Scaled Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-38919-2_18openalex-snapshot
Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-07148-0_2openalex-snapshot
Parallel Algorithms for Combinatorial Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-46049-9_6openalex-snapshot
Parallel Lookups in String Indexes
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_44openalex-snapshot
Duel and Sweep Algorithm for Order-Preserving Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_6openalex-snapshot
Generalized Function Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-10210-3_24openalex-snapshot
Theoretical Issues of Cluster Pattern Interfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_7openalex-snapshot
Constant-Time Word-Size String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_5openalex-snapshot
Prefix Table Construction and Conversion
inferred← citeshttps://doi.org/10.1007/bf01190846openalex-snapshot
Squares, cubes, and time-space efficient string searching
inferred← citeshttps://doi.org/10.1007/bf01294132openalex-snapshot
Finding all periods and initial palindromes of a string in parallel
inferred← citeshttps://doi.org/10.1007/bf02238127openalex-snapshot
Fast string matching algorithms for run-length coded strings
inferred← citeshttps://doi.org/10.1007/bfb0029804openalex-snapshot
Detecting false matches in string matching algorithms
inferred← citeshttps://doi.org/10.1007/bfb0029807openalex-snapshot
A unifying look at d-dimensional periodicities and space coverings
inferred← citeshttps://doi.org/10.1007/bfb0049432openalex-snapshot
Work-time optimal parallel prefix matching
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90076-8openalex-snapshot
A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90020-aopenalex-snapshot
Two-dimensional pattern matching by sampling
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90136-wopenalex-snapshot
A string-matching algorithm for the CREW PRAM
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90045-1openalex-snapshot
Fast string matching with k differences
inferred← citeshttps://doi.org/10.1016/0031-3203(91)90090-ropenalex-snapshot
Parallel (pram erew) algorithms for contour-based 2D shape recognition
inferred← citeshttps://doi.org/10.1016/0031-3203(92)90027-gopenalex-snapshot
A randomized parallel algorithm for string matching on hypercube
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90010-2openalex-snapshot
Fast parallel and serial approximate string matching
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90003-uopenalex-snapshot
Efficient pattern matching with scaling
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90178-7openalex-snapshot
Efficient string matching with k mismatches
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90112-0openalex-snapshot
Matching patterns in strings subject to multi-linear transformations
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90134-xopenalex-snapshot
Complexity, combinatorial group theory and the language of palutators
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90073-bopenalex-snapshot
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90318-vopenalex-snapshot
Fast parallel and serial multidimensional approximate array matching
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00012-3openalex-snapshot
On two-dimensional pattern matching by optimal parallel algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00263-0openalex-snapshot
Sorting strings and constructing digital search trees in parallel
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90030-2openalex-snapshot
An efficient parallel algorithm for the single function coarsest partition problem
inferred← citeshttps://doi.org/10.1016/0743-7315(87)90035-9openalex-snapshot
Parallel algorithms for message decomposition
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/j.dam.2005.02.019openalex-snapshot
Optimal discovery of repetitions in 2D
inferred← citeshttps://doi.org/10.1016/j.jda.2006.10.001openalex-snapshot
Generalized function matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.013openalex-snapshot
Towards optimal packed string matching
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60006-6openalex-snapshot
Parallel Algorithms for Some Computational Problems
inferred← citeshttps://doi.org/10.1016/s0129-0657(01)00087-4openalex-snapshot
STRING MATCHING ARTIFICIAL NEURAL NETWORKS
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00088-9openalex-snapshot
Inplace 2D matching in compressed images
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00041-5openalex-snapshot
Inplace run-length 2d compressed search
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00252-1openalex-snapshot
Alphabet-independent optimal parallel search for three-dimensional patterns
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80023-5openalex-snapshot
Parallel tree pattern matching
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00162-7openalex-snapshot
Parallel two dimensional witness computation
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00476-7openalex-snapshot
Optimal Parallel Searching an Array for Certain Repetitions
inferred← citeshttps://doi.org/10.1051/ita/1996300605211openalex-snapshot
Efficient string matching on packed texts
inferred← citeshttps://doi.org/10.1080/00207169208804061openalex-snapshot
An 0(1) time algorithm for string matching
inferred← citeshttps://doi.org/10.1080/00207169608804533openalex-snapshot
On the lower bound for parallel string matching
inferred← citeshttps://doi.org/10.1109/3477.718520openalex-snapshot
Matching of complex patterns by energy minimization
inferred← citeshttps://doi.org/10.1109/3477.718523openalex-snapshot
Optimal neural network algorithm for on-line string matching
inferred← citeshttps://doi.org/10.1109/clustr.2002.1137737openalex-snapshot
Parallel pattern identification in biological sequences on clusters
inferred← citeshttps://doi.org/10.1109/dcc.1992.227453openalex-snapshot
Efficient two-dimensional compressed matching
inferred← citeshttps://doi.org/10.1109/dcc.1999.755681openalex-snapshot
Almost-optimal fully LZW-compressed pattern matching
inferred← citeshttps://doi.org/10.1109/dcc.2008.105openalex-snapshot
Table Compression by Record Intersections
inferred← citeshttps://doi.org/10.1109/ipps.1994.288278openalex-snapshot
Sorting strings and constructing digital search trees in parallel
inferred← citeshttps://doi.org/10.1109/secon.2007.342925openalex-snapshot
A distributed bioinformatics computing system for analysis of DNA sequences
inferred← citeshttps://doi.org/10.1109/sfcs.1985.22openalex-snapshot
Efficient string matching in the presence of errors
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267767openalex-snapshot
Truly alphabet-independent two-dimensional pattern matching
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267791openalex-snapshot
Tighter bounds on the exact complexity of string matching
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366862openalex-snapshot
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
inferred← citeshttps://doi.org/10.1109/tkde.2025.3649808openalex-snapshot
Order-Preserving Pattern Matching: Review
inferred← citeshttps://doi.org/10.1109/tnb.2003.810165openalex-snapshot
Parallel pattern identification in biological sequences on clusters
inferred← citeshttps://doi.org/10.1137/0219072openalex-snapshot
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
inferred← citeshttps://doi.org/10.1137/0220002openalex-snapshot
Deterministic Sampling–A New Technique for Fast Pattern Matching
inferred← citeshttps://doi.org/10.1137/0221050openalex-snapshot
A Lower Bound for Parallel String Matching
inferred← citeshttps://doi.org/10.1137/s0097539791195543openalex-snapshot
Tight Bounds on the Complexity of the Boyer–Moore String Matching Algorithm
inferred← citeshttps://doi.org/10.1137/s0097539792190157openalex-snapshot
Parallel Suffix–Prefix-Matching Algorithm and Applications
inferred← citeshttps://doi.org/10.1137/s0097539792241941openalex-snapshot
Alphabet-Independent Two-Dimensional Witness Computation
inferred← citeshttps://doi.org/10.1137/s009753979324694xopenalex-snapshot
Tighter Upper Bounds on the Exact Complexity of String Matching
inferred← citeshttps://doi.org/10.1137/s0097539795280068openalex-snapshot
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
inferred← citeshttps://doi.org/10.1137/s009753979528007xopenalex-snapshot
Constant-Time Randomized Parallel String Matching
inferred← citeshttps://doi.org/10.1137/s0097539795298321openalex-snapshot
Two-Dimensional Periodicity in Rectangular Arrays
inferred← citeshttps://doi.org/10.1137/s0895480101390308openalex-snapshot
Three-Dimensional Periodicity and Its Application to Pattern Matching
inferred← citeshttps://doi.org/10.1142/s0129054105003662openalex-snapshot
THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
inferred← citeshttps://doi.org/10.1142/s0218001401001349openalex-snapshot
OPTIMALLY FAST CRCW-PRAM TESTING 2D-ARRAYS FOR EXISTENCE OF REPETITIVE PATTERNS
inferred← citeshttps://doi.org/10.1145/100216.100235openalex-snapshot
Deterministic sampling---a new technique for fast pattern matching
inferred← citeshttps://doi.org/10.1145/103418.103465openalex-snapshot
A lower bound for parallel string matching
inferred← citeshttps://doi.org/10.1145/12130.12152openalex-snapshot
Introducing efficient parallelism into approximate string matching and a new serial algorithm
inferred← citeshttps://doi.org/10.1145/129712.129720openalex-snapshot
A constant-time optimal parallel string-matching algorithm
inferred← citeshttps://doi.org/10.1145/165231.165239openalex-snapshot
Highly efficient dictionary matching in parallel
inferred← citeshttps://doi.org/10.1145/165231.165242openalex-snapshot
Optimal parallel two dimensional pattern matching
inferred← citeshttps://doi.org/10.1145/165231.165261openalex-snapshot
An efficient parallel algorithm for the single function coarsest partition problem
inferred← citeshttps://doi.org/10.1145/181014.181092openalex-snapshot
AT2 bounds for a class of VLSI problems and string matching
inferred← citeshttps://doi.org/10.1145/195058.195164openalex-snapshot
Symmetry breaking for suffix tree construction
inferred← citeshttps://doi.org/10.1145/1971681.1971689openalex-snapshot
Strategies for preparing computer science students for the multicore world
inferred← citeshttps://doi.org/10.1145/210332.210341openalex-snapshot
A constant-time optimal parallel string-matching algorithm
inferred← citeshttps://doi.org/10.1145/215399.215451openalex-snapshot
Optimal parallel dictionary matching and compression (extended abstract)
inferred← citeshttps://doi.org/10.1145/225058.225289openalex-snapshot
Work-time-optimal parallel algorithms for string problems
inferred← citeshttps://doi.org/10.1145/258492.258498openalex-snapshot
Three-dimensional pattern matching
inferred← citeshttps://doi.org/10.1145/2650220openalex-snapshot
Two-Dimensional Parameterized Matching
inferred← citeshttps://doi.org/10.1145/2935764.2935800openalex-snapshot
Parallel Approaches to the String Matching Problem on the GPU
inferred← citeshttps://doi.org/10.1145/3318.3478openalex-snapshot
Optimal parallel generation of a computation tree form
inferred← citeshttps://doi.org/10.1145/3409964.3461793openalex-snapshot
String Matching with Wildcards in the Massively Parallel Computation Model
inferred← citeshttps://doi.org/10.1145/72935.72977openalex-snapshot
Optimal parallel suffix-prefix matching algorithm and applications
inferred← citeshttps://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms
inferred← citeshttps://doi.org/10.11606/t.45.2000.tde-20210729-115206openalex-snapshot
Algoritmos CGM para busca uni e bidimensional de padrões com e sem escala
inferred← citeshttps://doi.org/10.1184/r1/6587387openalex-snapshot
A fast parallel algorithm to determine edit distance
inferred← citeshttps://doi.org/10.1201/9781420011296.ch30openalex-snapshot
Parallel Algorithms on Strings
inferred← citeshttps://doi.org/10.3844/ajbsp.2013.15.23openalex-snapshot
AN EFFICIENT DISTRIBUTED BIOINFORMATICS COMPUTING SYSTEM FOR DNA SEQUENCE ANALYSIS ON ENCODING SYSTEM
inferred← citeshttps://doi.org/10.48550/arxiv.1509.06167openalex-snapshot
Parallel Query in the Suffix Tree
inferred← citeshttps://doi.org/10.5555/320176.320220openalex-snapshot
Efficient pattern matching with scaling
inferred← citeshttps://doi.org/10.60692/paeay-z9v47openalex-snapshot
AN EFFICIENT DISTRIBUTED BIOINFORMATICS COMPUTING SYSTEM FOR DNA SEQUENCE ANALYSIS ON ENCODING SYSTEM
inferred← citeshttps://doi.org/10.7146/brics.v1i42.21600openalex-snapshot
Efficient String Matching on Coded Texts
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.