Author:
Crochemore Maxime,Ilie Lucian,Iliopoulos Costas S.,Kubica Marcin,Rytter Wojciech,Waleń Tomasz
Publisher
Springer Berlin Heidelberg
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An Approach for LPF Table Computation;Communications in Computer and Information Science;2019
2. On the Computation of Longest Previous Non-overlapping Factors;String Processing and Information Retrieval;2019
3. Efficient Approaches to Compute Longest Previous Non-overlapping Factor Array;Fundamenta Informaticae;2018-11-03
4. Conclusion and Future Work;Shared-Memory Parallelism Can Be Simple, Fast, and Scalable;2017-06-09
5. Parallel Cartesian Tree and Suffix Tree Construction;Shared-Memory Parallelism Can Be Simple, Fast, and Scalable;2017-06-09