Gang Chen, Simon J. Puglisi, William F. Smyth. Fast and Practical Algorithms for Computing All the Runs in a String. In Bin Ma, Kaizhong Zhang, editors, Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings. Volume 4580 of Lecture Notes in Computer Science, pages 307-315, Springer, 2007. [doi]
@inproceedings{ChenPS07,
title = {Fast and Practical Algorithms for Computing All the Runs in a String},
author = {Gang Chen and Simon J. Puglisi and William F. Smyth},
year = {2007},
doi = {10.1007/978-3-540-73437-6_31},
url = {http://dx.doi.org/10.1007/978-3-540-73437-6_31},
researchr = {https://researchr.org/publication/ChenPS07},
cites = {0},
citedby = {0},
pages = {307-315},
booktitle = {Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings},
editor = {Bin Ma and Kaizhong Zhang},
volume = {4580},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-73436-9},
}