Finding all the palindromes in a binary tree in linear time and space☆
References (6)
- et al.
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
Theoret. Comput. Sci.
(1991) Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
Inform. Process. Lett.
(1976)- et al.
Finding all the palindromes of a string in linear time and space
There are more references available in the full text version of this article.
Cited by (0)
- ☆
This work has been supported in part by M.U.R.S.T. of Italy.
Copyright © 1992 Published by Elsevier B.V.