Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Gad M. Landau, Uzi Vishkin. Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA. pages 220-230, ACM, 1986.

This author has not been identified. Look up 'Gad M. Landau' in GoogleThis author has not been identified. Look up 'Uzi Vishkin' in Google

runs on WebDSL