Author:
Iliopoulos Costas S.,Park Kunsoo
Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. Optimal parallel algorithms for periods, palindromes and squares;Apostolico,1992
2. Efficient detection of quasiperiodicities in strings;Apostolico;Theoret. Comput. Sci.,1993
3. Optimal superprimitivity testing for strings;Apostolico;Inform. Process. Lett.,1991
4. The subtree max gap problem with application to parallel string covering;Ben-Amram,1994
5. Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values;Berkman;J. Algorithms,1993
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. String Covering: A Survey;Fundamenta Informaticae;2023-10-27
2. Enhanced string covering;Theoretical Computer Science;2013-09
3. On left and right seeds of a string;Journal of Discrete Algorithms;2012-12
4. Generalized approximate regularities in strings;International Journal of Computer Mathematics;2008-02
5. Computing the λ-covers of a string;Information Sciences;2007-10