An optimal O(log log n) time parallel string matching algorithm (1990)
by
Dany Breslauer
,
Zvi Galil
| Venue: | SIAM J. COMPUT |
| Citations: | 28 - 11 self |
BibTeX
@ARTICLE{Breslauer90anoptimal,
author = {Dany Breslauer and Zvi Galil},
title = {An optimal O(log log n) time parallel string matching algorithm},
journal = {SIAM J. COMPUT},
year = {1990},
volume = {19},
pages = {1051--1058}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An optimal O(log log n) time parallel algorithm for string matching on CRCWPRAM is presented. It improves previous results of [G] and [V].
