Efficient parallel algorithms to test square-freeness and factorize strings (Q1178198): Difference between revisions

@@ Property / cites work @@
+Q3690245
@@ Property / cites work: Q3690245 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel construction of a suffix tree with applications
+Normal rank
@@ Property / cites work @@
+Optimal off-line detection of repetitions in a string
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for computing the repetitions in a word
+Normal rank
@@ Property / cites work @@
+Transducers and repetitions
@@ Property / cites work: Transducers and repetitions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3355232
@@ Property / cites work: Q3355232 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992991
@@ Property / cites work: Q3992991 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3659988
@@ Property / cites work: Q3659988 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for finding all repetitions in a string
+Normal rank
@@ Property / cites work @@
+An O(logn) parallel connectivity algorithm
@@ Property / cites work: An O(logn) parallel connectivity algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A universal algorithm for sequential data compression
+Normal rank