Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:digitalcommons.butler.edu:facsch_papers-1081

A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM

Authors
Publication date
1 January 2010
Publisher
Digital Commons @ Butler University
Doi

    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 \u3e 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

    Similar works

    Full text

    thumbnail-image

    Digital Commons @ Butler University

    redirect
    oaioai:digitalcommons.butler.edu:...
    Last time updated on 17/11/2016

    This paper was published in Digital Commons @ Butler University.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.