Document Type

Article

Publication Date

2010

Publication Title

Information Processing Letters

First Page

198

Last Page

201

DOI

http://dx.doi.org/10.1016/j.ipl.2009.12.008

Abstract

We present a randomized parallel algorithm that computes the greatest common divisor of two integers of n bits in length with probability 1−o(1) that takes O(n log logn/ logn) time using O(n6 + ) processors for any > 0 on the EREW PRAM parallel model of computation. The algorithm either gives a correct answer or reports failure. We believe this to be the first randomized sublinear time algorithm on the EREW PRAM for this problem.

Rights

This article was archived with permission from Elsevier, all rights reserved. Document also available from

Share

COinS