The complexity of the Multiple Pattern Matching Problem for random strings - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Frédérique Bassino' in GoogleThis author has not been identified. Look up 'Tsinjo Rakotoarimalala' in GoogleThis author has not been identified. Look up 'Andrea Sportiello' in Google

runs on WebDSL