by Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis
Reference:
T. Kociumaka, R. Kundu, M. Mohamed, S. P. Pissis, "Longest Unbordered Factor in Quasilinear Time", in 29th International Symposium on Algorithms and Computation (ISAAC 2018), W. Hsu, D. Lee, C. Liao, Eds., Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 70:1–70:13.
Bibtex Entry:
@InProceedings{kociumaka_et_al:LIPIcs:2018:10018,
author ={Tomasz Kociumaka and Ritu Kundu and Manal Mohamed and Solon P. Pissis},
title ={{Longest Unbordered Factor in Quasilinear Time}},
booktitle ={29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages ={70:1--70:13},
series ={Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN ={978-3-95977-094-1},
ISSN ={1868-8969},
year ={2018},
volume ={123},
editor ={Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao},
publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address ={Dagstuhl, Germany},
URL ={http://drops.dagstuhl.de/opus/volltexte/2018/10018},
URN ={urn:nbn:de:0030-drops-100184},
doi ={10.4230/LIPIcs.ISAAC.2018.70},
annote ={Keywords: longest unbordered factor, factorisation, period, border, strings}
}