Maxim A. Babenko, Ignat I. Kolesnichenko, Tatiana A. Starikovskaya. On Minimal and Maximal Suffixes of a Substring. In Johannes Fischer, Peter Sanders, editors, Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. Volume 7922 of Lecture Notes in Computer Science, pages 28-37, Springer, 2013. [doi]
@inproceedings{BabenkoKS13,
title = {On Minimal and Maximal Suffixes of a Substring},
author = {Maxim A. Babenko and Ignat I. Kolesnichenko and Tatiana A. Starikovskaya},
year = {2013},
doi = {10.1007/978-3-642-38905-4_5},
url = {http://dx.doi.org/10.1007/978-3-642-38905-4_5},
researchr = {https://researchr.org/publication/BabenkoKS13},
cites = {0},
citedby = {0},
pages = {28-37},
booktitle = {Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings},
editor = {Johannes Fischer and Peter Sanders},
volume = {7922},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-38905-4},
}