On the public citation graph

The derivation of on-line algorithms, with an application to finding palindromes

https://doi.org/10.1007/bf01182773
0 signed · 38 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/3-540-52282-4_36openalex-snapshot
Parallel computations on strings and arrays
inferredcites →https://doi.org/10.1007/978-3-642-74884-4_5openalex-snapshot
Lectures on Constructive Functional Programming
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-87374-4_1openalex-snapshot
An Introduction to the Theory of Lists
inferredcites →https://doi.org/10.1007/bf00289248openalex-snapshot
Iterative arrays with direct central control
inferredcites →https://doi.org/10.1016/0020-0190(76)90050-8openalex-snapshot
Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
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.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0167-6423(89)90036-1openalex-snapshot
Formal derivation of a pattern matching algorithm
inferredcites →https://doi.org/10.1016/0167-6423(89)90041-5openalex-snapshot
Introduction to functional programming
inferredcites →https://doi.org/10.1016/0167-6423(90)90023-7openalex-snapshot
Data structures and program transformation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
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.1142/9789812794499_0004openalex-snapshot
Memories of ADJ
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/322047.322056openalex-snapshot
A Linear-Time On-Line Recognition Algorithm for ``Palstar''
inferredcites →https://doi.org/10.1145/322234.322244openalex-snapshot
String Matching in Real Time
inferredcites →https://doi.org/10.1145/800113.803644openalex-snapshot
Real-time algorithms for string-matching and palindrome recognition
inferredcites →https://doi.org/10.3990/1.9789090048161openalex-snapshot
Law and Order in Algorithmics

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-58402-1_3openalex-snapshot
Viewing a program transformation system at work
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_19openalex-snapshot
Combinatorics of Palindromes
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_10openalex-snapshot
Asymptotically Optimal Representation of Palindromic Structure
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-40355-2_18openalex-snapshot
Finding Palindromes: Variants and Algorithms
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.jda.2013.06.003openalex-snapshot
Time–space trade-offs for longest common extensions
inferred← citeshttps://doi.org/10.1016/j.jda.2014.08.001openalex-snapshot
A subquadratic algorithm for minimum palindromic factorization
inferred← citeshttps://doi.org/10.1088/1742-6596/1889/2/022037openalex-snapshot
Two problems about calculating the number of palindromes with different numbers of digits
inferred← citeshttps://doi.org/10.1142/s012905412250006xopenalex-snapshot
HV-Palindromes in Two-Dimensional Words
inferred← citeshttps://doi.org/10.1145/1328408.1328414openalex-snapshot
Maximum segment sum is back
inferred← citeshttps://doi.org/10.1145/242224.242444openalex-snapshot
Future directions in program transformations
inferred← citeshttps://doi.org/10.1145/251595.251609openalex-snapshot
Future directions in program transformations
inferred← citeshttps://doi.org/10.13189/ms.2021.090604openalex-snapshot
The Combinatorial Expressions and Probability of Random Generation of Binary Palindromic Digit Combinations
inferred← citeshttps://doi.org/10.3990/1.9789090048161openalex-snapshot
Law and Order in Algorithmics
inferred← citeshttps://doi.org/10.48550/arxiv.1211.0270openalex-snapshot
Time-Space Trade-Offs for Longest Common Extensions
inferred← citeshttps://doi.org/10.48550/arxiv.1904.11334openalex-snapshot
Palindromes in two-dimensional Words
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.