Name
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(log/sup 2/n) time with O(n/sup 2//log/sup 2/n) processors on the EREW-PRAM model. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/IPPS.1992.223062 | Beverly Hills, CA |
Keywords | Field | DocType |
parallel algorithm,string x,erew-pram model,strings y,polynomials,time complexity,space complexity,data structures,computational complexity,parallel algorithms,dynamic programming | Data structure,Computer science,Parallel algorithm,Parallel computing,Time complexity,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
0-8186-2672-0 | 0 | 0.34 |
References | Authors | |
2 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| ahmed saoudi | 1 | 204 | 30.46 |
| Maurice Nivat | 2 | 1261 | 277.74 |
| C. Pandu Rangan | 3 | 1434 | 149.57 |
| Ravi Sundaram | 4 | 762 | 72.13 |
| G. D. S. Ramkumar | 5 | 149 | 16.46 |