Md. Faizul Bari, Mohammad Sohel Rahman, Rifat Shahriyar. Finding All Covers of an Indeterminate String in O(n) Time on Average. In Jan Holub, Jan Zdárek, editors, Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic,August 31 - September 2, 2009. pages 263-271, Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, 2009. [doi]
@inproceedings{BariRS09,
title = {Finding All Covers of an Indeterminate String in O(n) Time on Average},
author = {Md. Faizul Bari and Mohammad Sohel Rahman and Rifat Shahriyar},
year = {2009},
url = {http://www.stringology.org/event/2009/p24.html},
researchr = {https://researchr.org/publication/BariRS09},
cites = {0},
citedby = {0},
pages = {263-271},
booktitle = {Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic,August 31 - September 2, 2009},
editor = {Jan Holub and Jan Zdárek},
publisher = {Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague},
isbn = {978-80-01-04403-2},
}