A randomized sublinear time parallel GCD algorithm for the EREW PRAM
From MaRDI portal
Publication:991752
DOI10.1016/J.IPL.2009.12.008zbMATH Open1209.68627OpenAlexW2158251041MaRDI QIDQ991752FDOQ991752
Authors: Jonathan P. Sorenson 
Publication date: 7 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.butler.edu/facsch_papers/81
Recommendations
randomized algorithmsnumber theoretic algorithmsparallel algorithmsalgorithm analysisgreatest common divisorsmooth numbers
Cites Work
- Title not available (Why is that?)
- Fast multiplication of large numbers
- Integers without large prime factors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two Fast GCD Algorithms
- Fast parallel matrix and GCD computations
- Log Depth Circuits for Division and Related Problems
- An improved parallel algorithm for integer GCD
- On a parallel Lehmer-Euclid GCD algorithm
- Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers
- Two fast parallel prime number sieves
- A parallel extended GCD algorithm
- Efficient algorithms for computing the Jacobi symbol
- A modular reduction for GCD computation.
- Modular exponentiation via the explicit Chinese remainder theorem
- Title not available (Why is that?)
- Algorithmic Number Theory
- Fast arithmetics using Chinese remaindering
Cited In (1)
This page was built for publication: A randomized sublinear time parallel GCD algorithm for the EREW PRAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991752)
