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

@article{Jeuring2005TheDO,
title={The derivation of on-line algorithms, with an application to finding palindromes},
author={Johan Jeuring},
journal={Algorithmica},
year={2005},
volume={11},
pages={146-184}
}
• J. Jeuring
• Published 1 February 1994
• Mathematics
• Algorithmica
A theory for the derivation of on-line algorithms is presented. The algorithms are derived in the Bird-Meertens calculus for program transformations. This calculus provides a concise functional notation for algorithms, and a few powerful theorems for proving equalities of functions. The theory for the derivation of on-line algorithms is illustrated with the derivation of an algorithm for finding palindromes.An on-line linear-time random access machine (RAM) algorithm for finding the longest…
11 Citations
Finding Palindromes: Variants and Algorithms
• J. Jeuring
• Computer Science, Mathematics
The Beauty of Functional Code
• 2013
Several predicates that represent variants of the problem of finding palindromes in strings are introduced and properties for palindrome predicates are introduced, and it is shown how some of the predicates can be extended to satisfy the properties that allow us to use an algorithm for finding palINDromes.
Longest Palindromic Substring in Sublinear Time
• Computer Science
CPM
• 2022
This work revisits the classic algorithmic problem of computing a longest palidromic substring and devise a simple O ( n log σ/ log n )-time algorithm that works in sublinear time if σ = 2 o (log n ) .
Two problems about calculating the number of palindromes with different numbers of digits
• Mathematics
• 2021
The aim of this work is to obtain two types of regularities for calculating the number of palindromes. The main results of the work are presented by solving two problems. In the first problem
The Combinatorial Expressions and Probability of Random Generation of Binary Palindromic Digit Combinations
• V. Lyubimov
• Computer Science, Mathematics
Mathematics and Statistics
• 2021
The aim of this paper is to obtain three types of expressions for calculating the probability of implementing palindromic digit combinations on a finite equally possible combination of zeros and
Palindromes in two-dimensional Words
• Mathematics
ArXiv
• 2019
This work investigates the maximum number number of distinct non-empty HV-palindromic sub-arrays in any finite $2$D word, thus, proving the conjecture given by Anisiua et al.
A subquadratic algorithm for minimum palindromic factorization
• Computer Science, Mathematics
J. Discrete Algorithms
• 2014
Topics in combinatorial pattern matching
• Computer Science
• 2015
A lower bound is given on the time-space product for LCE data structures in the non-uniform cell probe model showing that the second trade-off is nearly optimal.
Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths
It turns out that, while the classical MSS problem is solved by the Greedy Theorem, by applying the Thinning The theorem, one gets a linear-time algorithm for MSS with upper bound on length.
Time-Space Trade-Offs for Longest Common Extensions
• Computer Science
CPM
• 2012
The time-space trade-offs for the LCE problem, that is, the space used for the data structure vs. the worst-case time for answering an LCE query, are studied.
Two-dimensional Total Palindrome Complexity
We initiate a comparative study of the properties of total palindrome complexity for binary words and arrays. From this point of view, the HV-palindrome complexity for arrays seems to be more