Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179): Difference between revisions

@@ Property / cites work @@
+The Boyer–Moore–Galil String Searching Strategies Revisited
+Normal rank
@@ Property / cites work @@
+A fast string searching algorithm
@@ Property / cites work: A fast string searching algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Speeding up two string-matching algorithms
@@ Property / cites work: Speeding up two string-matching algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4849531
@@ Property / cites work: Q4849531 / rank @@
+Normal rank
@@ Property / cites work @@
+On improving the worst case running time of the Boyer-Moore string matching algorithm
+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 Correct Preprocessing Algorithm for Boyer–Moore String-Searching
+Normal rank
@@ Property / cites work @@
+Q4859180
@@ Property / cites work: Q4859180 / rank @@
+Normal rank