A d-Step Approach for Distinct Squares in Strings (Q3011845): Difference between revisions

@@ Property / cites work @@
+On the structure of run-maximal strings
@@ Property / cites work: On the structure of run-maximal strings / rank @@
+Normal rank
@@ Property / cites work @@
+A \(d\)-step approach to the maximum number of distinct squares and runs in strings
+Normal rank
@@ Property / cites work @@
+How many squares can a string contain?
@@ Property / cites work: How many squares can a string contain? / rank @@
+Normal rank
@@ Property / cites work @@
+A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
+Normal rank
@@ Property / cites work @@
+A note on the number of squares in a word
@@ Property / cites work: A note on the number of squares in a word / rank @@
+Normal rank
@@ Property / cites work @@
+Q3087203
@@ Property / cites work: Q3087203 / rank @@
+Normal rank