Zvi Calil' Columbia University andTel-Aviv University This paper prespnts two ",flit-iE-lit concnrrf:'nt-read cone-uTfPnt-writE' parallel algorithms that find all palindromE's in a givPlI string:J. An ()(Io~n) timf', n-[ITOCE'Ssor alp;orithm over general alphahets. In case of can· stant size alphahpts til(>
This article presents a real-time randomized streaming string-matching algorithm that uses O(log m) space. The algorithm only makes one-sided small probability false-positive errors, possibly reporting phantom occurrences of the pattern, but never missing an actual occurrence.
An optimal O(loglogn) time concurrent-read concurrent-write parallel algorithm for detecting all squares in a string is presented. A tight lower bound shows that over general alphabets this is the fastest possible optimal algorithm. When p processors are available the bounds become 0(fnl;gnl +loglogrl+p/n12p).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.