Jeuring (Longest Palindromic Substring Longest Palindromic Substring)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$? words

(Stores (and uses) previously computed palindrome information; unclear if O(n) is best bound possible)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1994

Reference

https://doi.org/10.1007%2FBF01182773