A randomized sublinear time parallel GCD algorithm for the EREW PRAM
type: Item
instance of: scholarly article
title: A randomized sublinear time parallel GCD algorithm for the EREW PRAM
zbMATH Open document ID: 1209.68627
author: Jonathan P. Sorenson
published in: Information Processing Letters
publication date: 2010-09-07T00:00:00Z
full work available at URL: https://digitalcommons.butler.edu/facsch_papers/81
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 5780800
zbMATH Keywords: parallel algorithms
zbMATH Keywords: randomized algorithms
zbMATH Keywords: algorithm analysis
zbMATH Keywords: greatest common divisor
zbMATH Keywords: number theoretic algorithms
zbMATH Keywords: smooth numbers
MaRDI profile type: Publication
OpenAlex ID: W2158251041
cites work: Q4888749
cites work: Log Depth Circuits for Division and Related Problems
cites work: Modular exponentiation via the explicit Chinese remainder theorem
cites work: Fast parallel matrix and GCD computations
cites work: An improved parallel algorithm for integer GCD
cites work: Fast arithmetics using Chinese remaindering
cites work: Efficient algorithms for computing the Jacobi symbol
cites work: Q4843270
cites work: Integers without large prime factors
cites work: Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
cites work: Q4385522
cites work: Algorithmic Number Theory
cites work: Fast multiplication of large numbers
cites work: A parallel extended GCD algorithm
cites work: On a parallel Lehmer-Euclid GCD algorithm
cites work: A modular reduction for GCD computation.
cites work: Two Fast GCD Algorithms
cites work: Q4664856
cites work: Two fast parallel prime number sieves
cites work: Q3123961
DOI: 10.1016/J.IPL.2009.12.008
description: scientific article; zbMATH DE number 5780800