Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
A Randomized Sublinear Time Parallel Gcd Algorithm For The Erew Pram, Jonathan P. Sorenson
A Randomized Sublinear Time Parallel Gcd Algorithm For The Erew Pram, Jonathan P. Sorenson
Scholarship and Professional Work - LAS
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.
Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen
Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.