On the public citation graph
Optimal parallel detection of squares in strings
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/3-540-18088-5_26openalex-snapshot
Parallel construction of a suffix tree
inferredcites →https://doi.org/10.1007/978-3-642-82456-2openalex-snapshot
Combinatorial Algorithms on Words
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_18openalex-snapshot
Linear Time Recognition of Squarefree Strings
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_19openalex-snapshot
Discovering Repetitions in Strings
inferredcites →https://doi.org/10.1007/bf01762122openalex-snapshot
Parallel construction of a suffix tree with applications
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/0022-0000(85)90060-1openalex-snapshot
Structural properties of the string statistics problem
inferredcites →https://doi.org/10.1016/0196-6774(83)90017-2openalex-snapshot
Factorizing words over an ordered alphabet
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/0304-3975(83)90109-3openalex-snapshot
Optimal off-line detection of repetitions in a string
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.1051/ita/1984180201471openalex-snapshot
On context constrained squares and repetitions in a string
inferredcites →https://doi.org/10.1137/0219066openalex-snapshot
Efficient Parallel Algorithms for String Editing and Related Problems
inferredcites →https://doi.org/10.1145/321921.321923openalex-snapshot
Bounds for the String Editing Problem
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.
inferredcites →https://doi.org/10.2307/1970044openalex-snapshot
Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_32openalex-snapshot
Efficient string matching on coded texts
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_6openalex-snapshot
String Pattern Matching for a Deluge Survival Kit
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/bfb0029801openalex-snapshot
An algorithm for approximate tandem repeats
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90223-5openalex-snapshot
Efficient parallel algorithms to test square-freeness and factorize strings
inferred← citeshttps://doi.org/10.1016/0167-8655(94)00091-gopenalex-snapshot
A note on parsing pattern languages
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90134-2openalex-snapshot
String-matching on ordered alphabets
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90159-qopenalex-snapshot
Efficient detection of quasiperiodicities in strings
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90197-2openalex-snapshot
Efficient CRCW-PRAM algorithms for universal substring searching
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.tcs.2006.06.011openalex-snapshot
An efficient algorithm for online square detection
inferred← citeshttps://doi.org/10.1051/ita/1996300605211openalex-snapshot
Efficient string matching on packed texts
inferred← citeshttps://doi.org/10.1089/106652701300099038openalex-snapshot
An Algorithm for Approximate Tandem Repeats
inferred← citeshttps://doi.org/10.1089/cmb.2007.0018openalex-snapshot
A Novel Approach to the Detection of Genomic Approximate Tandem Repeats in the Levenshtein Metric
inferred← citeshttps://doi.org/10.1137/s0097539793260404openalex-snapshot
An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String
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/3145777.3145780openalex-snapshot
Object detection on hindered condition by using chain code-based angle detection
inferred← citeshttps://doi.org/10.3390/math10214038openalex-snapshot
A Class of Fibonacci Matrices, Graphs, and Games
inferred← citeshttps://doi.org/10.7146/brics.v1i42.21600openalex-snapshot
Efficient String Matching on Coded Texts
inferred← citeshttps://doi.org/10.7146/brics.v2i11.19514openalex-snapshot
An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String
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.