Author:
Kociumaka Tomasz,Pachocki Jakub,Radoszewski Jakub,Rytter Wojciech,Waleń Tomasz
Funder
Ministry of Science and Higher Education
Foundation For Polish Science
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. Efficient counting of square substrings in a tree;Kociumaka,2012
2. Repetitions in strings: algorithms and combinatorics;Crochemore;Theoret. Comput. Sci.,2009
3. Nonrepetitive colorings of trees;Bresar;Discrete Math.,2007
4. Nonrepetitive colorings of graphs;Czerwiński;Electron. Notes Discrete Math.,2007
5. Counting distinct squares in partial words;Blanchet-Sadri;Acta Cybernet.,2009
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tight Bound for the Number of Distinct Palindromes in a Tree;The Electronic Journal of Combinatorics;2023-04-21
2. String Covers of a Tree Revisited;String Processing and Information Retrieval;2023
3. Efficiently computing runs on a trie;Theoretical Computer Science;2021-10
4. String Covers of a Tree;String Processing and Information Retrieval;2021
5. A New Linear-Time Algorithm for Centroid Decomposition;String Processing and Information Retrieval;2019