Efficient counting of square substrings in a tree (Q2250458): Difference between revisions

@@ Property / author @@
+Jakub W. Pachocki
@@ Property / author: Jakub W. Pachocki / rank @@
+Normal rank
@@ Property / author @@
+Tomasz Walen
@@ Property / author: Tomasz Walen / 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/j.tcs.2014.04.015
+Normal rank
@@ Property / OpenAlex ID @@
+W1970774636
@@ Property / OpenAlex ID: W1970774636 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Counting of Square Substrings in a Tree
@@ Property / cites work: Efficient Counting of Square Substrings in a Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Repetitions in strings: algorithms and combinatorics
+Normal rank
@@ Property / cites work @@
+Nonrepetitive colorings of trees
@@ Property / cites work: Nonrepetitive colorings of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Nonrepetitive colorings of graphs
@@ Property / cites work: Nonrepetitive colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5306171
@@ Property / cites work: Q5306171 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonrepetitive list colourings of paths
@@ Property / cites work: Nonrepetitive list colourings of paths / rank @@
+Normal rank
@@ Property / cites work @@
+The Maximum Number of Squares in a Tree
@@ Property / cites work: The Maximum Number of Squares in a Tree / rank @@
+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 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 @@
+A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for finding and representing all the tandem repeats in a string
+Normal rank
@@ Property / cites work @@
+New simple efficient algorithms computing powers and runs in strings
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+The level ancestor problem simplified
@@ Property / cites work: The level ancestor problem simplified / rank @@
+Normal rank
@@ Property / cites work @@
+Jewels of Stringology
@@ Property / cites work: Jewels of Stringology / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for finding all repetitions in a string
+Normal rank
@@ Property / cites work @@
+Results and trends in theoretical computer science, Colloquium in honor of Arto Salomaa, Graz, Austria, June 10-11, 1994. Proceedings
+Normal rank
@@ Property / cites work @@
+Q4511228
@@ Property / cites work: Q4511228 / rank @@
+Normal rank