DocumentCode :
3204803
Title :
A parallel algorithm for recognizing the shuffle of two strings
Author :
Saoudi, Ahmed ; Nivat, Maurice ; Rangan, C. Pandu ; Sundaram, Ravi ; Ramkumar, G.D.S.
Author_Institution :
LIPN, Paris XIII Univ., Villetaneuse, France
fYear :
1992
fDate :
23-26 Mar 1992
Firstpage :
112
Lastpage :
115
Abstract :
Presents a parallel algorithm for verifying that a string X is formed by the shuffle of two strings Y and Z. The algorithm runs in O(log2n) time with O(n2/log2n) processors on the EREW-PRAM model
Keywords :
computational complexity; data structures; parallel algorithms; EREW-PRAM; O(log2n) time; O(n2/log2n) processors; parallel algorithm; string shuffle; time complexity, space complexity; Dynamic programming; Parallel algorithms; Polynomials; Transmission line matrix methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location :
Beverly Hills, CA
Print_ISBN :
0-8186-2672-0
Type :
conf
DOI :
10.1109/IPPS.1992.223062
Filename :
223062
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3204803
بازگشت