On the public citation graph
Finding all periods and initial palindromes of a string in parallel
0 signed · 66 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-55719-9_82openalex-snapshot
Optimal parallel algorithms for periods, palindromes and squares
inferredcites →https://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferredcites →https://doi.org/10.1016/0001-8708(77)90111-6openalex-snapshot
Complexity of computation
inferredcites →https://doi.org/10.1016/0020-0190(94)90060-4openalex-snapshot
Testing string superprimitivity in parallel
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
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.1016/0304-3975(94)00177-kopenalex-snapshot
Fast parallel string prefix-matching
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(85)80031-0openalex-snapshot
Optimal parallel algorithms for string matching
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/0221050openalex-snapshot
A Lower Bound for Parallel String Matching
inferredcites →https://doi.org/10.1137/s0097539793260404openalex-snapshot
An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/321892.321896openalex-snapshot
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
inferredcites →https://doi.org/10.1145/72935.72977openalex-snapshot
Optimal parallel suffix-prefix matching algorithm and applications
inferredcites →https://doi.org/10.1145/800152.804905openalex-snapshot
Rapid identification of repeated patterns in strings, trees and arrays
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.1007/3-540-55719-9_82openalex-snapshot
Optimal parallel algorithms for periods, palindromes and squares
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_166openalex-snapshot
Parallel detection of all palindromes in a string
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-63246-8_14openalex-snapshot
Of periods, quasiperiods, repetitions and covers
inferred← citeshttps://doi.org/10.1007/978-3-031-72200-4_21openalex-snapshot
Computing String Covers in Sublinear Time
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_7openalex-snapshot
Palindromic Decompositions with Gaps and Errors
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_5openalex-snapshot
Searching for Gapped Palindromes
inferred← citeshttps://doi.org/10.1007/978-3-642-16321-0_13openalex-snapshot
Counting and Verifying Maximal Palindromes
inferred← citeshttps://doi.org/10.1007/978-3-642-31265-6_24openalex-snapshot
Time-Space Trade-Offs for Longest Common Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-35926-2_24openalex-snapshot
Computing a Longest Common Palindromic Subsequence
inferred← citeshttps://doi.org/10.1007/978-3-642-39274-0_15openalex-snapshot
On Palindromic Sequence Automata and Applications
inferred← citeshttps://doi.org/10.1007/bf02684447openalex-snapshot
Parallel finding all initial palindromes and periods of a string on reconfigurable meshes
inferred← citeshttps://doi.org/10.1007/s00224-025-10258-3openalex-snapshot
Computing String Covers in Sublinear Time
inferred← citeshttps://doi.org/10.1007/s11786-016-0288-7openalex-snapshot
Palindromic Subsequence Automata and Longest Common Palindromic Subsequence
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90060-4openalex-snapshot
Testing string superprimitivity in parallel
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(94)00083-uopenalex-snapshot
Parallel detection of all palindromes in a string
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00177-kopenalex-snapshot
Fast parallel string prefix-matching
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105379openalex-snapshot
Double-ended palindromic trees in linear time
inferred← citeshttps://doi.org/10.1016/j.ins.2010.01.030openalex-snapshot
Data hiding methods based upon DNA sequences
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.07.018openalex-snapshot
Counting distinct palindromes in a word in linear time
inferred← citeshttps://doi.org/10.1016/j.jda.2013.06.003openalex-snapshot
Time–space trade-offs for longest common extensions
inferred← citeshttps://doi.org/10.1016/j.procs.2017.12.023openalex-snapshot
A Hybridized Model for Image Encryption through Genetic Algorithm and DNA Sequence
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.09.013openalex-snapshot
Searching for gapped palindromes
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.023openalex-snapshot
Efficient retrieval of approximate palindromes in a run-length encoded string
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00032-xopenalex-snapshot
Transforming comparison model lower bounds to the parallel-random-access-machine
inferred← citeshttps://doi.org/10.1016/s0031-3203(01)00179-0openalex-snapshot
Finding approximate palindromes in strings
inferred← citeshttps://doi.org/10.1051/ita/1996300605211openalex-snapshot
Efficient string matching on packed texts
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00095openalex-snapshot
Faster Approximate Pattern Matching: A Unified Approach
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00112openalex-snapshot
Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance
inferred← citeshttps://doi.org/10.1137/1.9781611973730.36openalex-snapshot
Internal Pattern Matching Queries in a Text and Applications
inferred← citeshttps://doi.org/10.1137/23m1567618openalex-snapshot
Internal Pattern Matching Queries in a Text and Applications
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/s0129054118430050openalex-snapshot
Palindromic Decompositions with Gaps and Errors
inferred← citeshttps://doi.org/10.3233/fi-2014-974openalex-snapshot
Computing a Longest Common Palindromic Subsequence
inferred← citeshttps://doi.org/10.3745/kipstb.2007.14-b.6.461openalex-snapshot
Identifying Variable-Length Palindromic Pairs in DNA Sequences
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2021.8openalex-snapshot
Weighted Ancestors in Suffix Trees Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1110.5296openalex-snapshot
Computing a Longest Common Palindromic Subsequence
inferred← citeshttps://doi.org/10.48550/arxiv.1607.06660openalex-snapshot
Fast Longest Common Extensions in Small Space
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08931openalex-snapshot
Palindromic Decompositions with Gaps and Errors
inferred← citeshttps://doi.org/10.5555/314464.314633openalex-snapshot
The subtree max gap problem with application to parallel string covering
inferred← citeshttps://doi.org/10.7146/brics.v1i42.21600openalex-snapshot
Efficient String Matching on Coded Texts
inferred← citeshttps://doi.org/10.7146/brics.v2i10.19513openalex-snapshot
Transforming Comparison Model Lower Bounds to the PRAM
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.