Towards a Solution to the “Runs” Conjecture (Q3506961): 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.1007/978-3-540-69068-9_27
+Normal rank
@@ Property / OpenAlex ID @@
+W1549299641
@@ Property / OpenAlex ID: W1549299641 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for computing the repetitions in a word
+Normal rank
@@ Property / cites work @@
+Analysis of Maximal Repetitions in Strings
@@ Property / cites work: Analysis of Maximal Repetitions in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Computing longest previous factor in linear time and applications
+Normal rank
@@ Property / cites work @@
+Repetitions in strings: algorithms and combinatorics
+Normal rank
@@ Property / cites work @@
+Not So Many Runs in Strings
@@ Property / cites work: Not So Many Runs in Strings / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting leftmost maximal periodicities
@@ Property / cites work: Detecting leftmost maximal periodicities / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for finding all repetitions in a string
+Normal rank
@@ Property / cites work @@
+How many runs can a string contain?
@@ Property / cites work: How many runs can a string contain? / rank @@
+Normal rank
@@ Property / cites work @@
+The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
+Normal rank
@@ Property / cites work @@
+The number of runs in a string
@@ Property / cites work: The number of runs in a string / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3506961