On the public citation graph

Real-time recognition of substring repetition and reversal

https://doi.org/10.1007/bf01768472
0 signed · 22 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/bf00289248openalex-snapshot
Iterative arrays with direct central control
inferredcites →https://doi.org/10.1016/0022-0000(78)90042-9openalex-snapshot
Palindrome recognition in real time by a multitape turing machine
inferredcites →https://doi.org/10.1051/epn/19700109003openalex-snapshot
Academy of Sciences of the USSR
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0174934-9openalex-snapshot
Uniqueness Theorems for Periodic Functions
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0249212-8openalex-snapshot
On the Minimum Computation Time of Functions
inferredcites →https://doi.org/10.1109/pgec.1965.264145openalex-snapshot
A One-Dimensional Real-Time Iterative Multiplier
inferredcites →https://doi.org/10.1109/t-c.1969.222663openalex-snapshot
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1145/321724.321726openalex-snapshot
Real-Time Simulation of Multihead Tape Units
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.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/978-3-642-21458-5_16openalex-snapshot
Simple Real-Time Constant-Space String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-82456-2_19openalex-snapshot
Discovering Repetitions in Strings
inferred← citeshttps://doi.org/10.1007/bf01404109openalex-snapshot
A simplified proof of the real-time recognizability of palindromes on turing machines
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90002-8openalex-snapshot
Time-space-optimal string matching
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90051-6openalex-snapshot
Detecting leftmost maximal periodicities
inferred← citeshttps://doi.org/10.1016/0196-6774(84)90021-xopenalex-snapshot
An O(n log n) algorithm for finding all repetitions in a string
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50010-2openalex-snapshot
Algorithms for Finding Patterns in Strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.040openalex-snapshot
Simple real-time constant-space string matching
inferred← citeshttps://doi.org/10.1109/sfcs.1977.27openalex-snapshot
Saving space in fast string-matching
inferred← citeshttps://doi.org/10.1137/0209032openalex-snapshot
Saving Space in Fast String-Matching
inferred← citeshttps://doi.org/10.1145/800076.802463openalex-snapshot
Time-space-optimal string matching (Preliminary Report)
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.