Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello. The complexity of the Multiple Pattern Matching Problem for random strings. In Markus E. Nebel, Stephan G. Wagner, editors, Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018. pages 40-53, SIAM, 2018. [doi]
@inproceedings{BassinoRS18,
title = {The complexity of the Multiple Pattern Matching Problem for random strings},
author = {Frédérique Bassino and Tsinjo Rakotoarimalala and Andrea Sportiello},
year = {2018},
doi = {10.1137/1.9781611975062.5},
url = {https://doi.org/10.1137/1.9781611975062.5},
researchr = {https://researchr.org/publication/BassinoRS18},
cites = {0},
citedby = {0},
pages = {40-53},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018},
editor = {Markus E. Nebel and Stephan G. Wagner},
publisher = {SIAM},
isbn = {978-1-61197-506-2},
}