Finding all the palindromes in a binary tree in linear time and space (Q1201867): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(92)90188-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2030432570
@@ Property / OpenAlex ID: W2030432570 / rank @@
+Normal rank
@@ Property / cites work @@
+Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
+Normal rank
@@ Property / cites work @@
+Finding all the palindromes in a binary tree in linear time and space
+Normal rank
@@ Property / cites work @@
+Q4140367
@@ Property / cites work: Q4140367 / rank @@
+Normal rank
@@ Property / cites work @@
+Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
+Normal rank
@@ Property / cites work @@
+Fast Pattern Matching in Strings
@@ Property / cites work: Fast Pattern Matching in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
+Normal rank