Author:
Nishida Makoto,I. Tomohiro,Inenaga Shunsuke,Bannai Hideo,Takeda Masayuki
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Undergraduate Texts in Mathematics;TM Apostol,1976
2. Blanchet-Sadri, F., Simmons, S., Tebbe, A., Veprauskas, A.: Abelian periods, partial words, and an extension of a theorem of Fine and Wilf. RAIRO - Theor. Inf. Appl. 47(3), 215–234 (2013)
3. Cazaux, B., Rivals, E.: Reverse engineering of compact suffix trees and links: a novel algorithm. J. Discrete Algorithms 28, 9–22 (2014)
4. Constantinescu, S., Ilie, L.: Fine and Wilf’s theorem for Abelian periods. Bull. EATCS 89, 167–170 (2006)
5. Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Pachocki, J., Radoszewski, J., Rytter, W., Tyczynski, W., Walen, T.: A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113(3), 74–77 (2013)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献