Finding all the palindromes in a binary tree in linear time and space
From MaRDI portal
Publication:1201867
DOI10.1016/0020-0190(92)90188-2zbMath0786.68036MaRDI QIDQ1201867
Bettina De Iaco, Fabrizio Luccio
Publication date: 17 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90188-2
Related Items
Cites Work
- Unnamed Item
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Finding all the palindromes in a binary tree in linear time and space
- Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Fast Pattern Matching in Strings