The complexity of the Multiple Pattern Matching Problem for random strings

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.