Two fast simulations which imply some fast string matching and palindrome-recognition algorithms (Q1226857): Difference between revisions

@@ Property / author @@
-Zvi Galil
@@ Property / author: Zvi Galil / rank @@
-Normal rank
@@ Property / author @@
+Zvi Galil
@@ Property / author: Zvi Galil / rank @@
+Normal rank
@@ 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(76)90050-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1972674211
@@ Property / OpenAlex ID: W1972674211 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4773298
@@ Property / cites work: Q4773298 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5616735
@@ Property / cites work: Q5616735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4055156
@@ Property / cites work: Q4055156 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast on-line integer multiplication
@@ Property / cites work: Fast on-line integer multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1226857