System Upgrade on Tue, May 28th, 2024 at 2am (EDT)
Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours. For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
This paper 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/log2 n) processors on the EREW-PRAM model.