A systolic algorithm for extended GCD computation

DOI10.1016/0898-1221(87)90130-1zbMath0657.10002OpenAlexW2030940013MaRDI QIDQ1110555

Richard P. Brent, Adam W. Bojanczyk

Publication date: 1987

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(87)90130-1

zbMATH Keywords

greatest common divisorcomputational number theorysystolic algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to number theory (11-04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (1)

A systolic algorithm for extended GCD computation

Cites Work

• A carry-free algorithm for finding the greatest common divisor of two integers
• A systolic algorithm for extended GCD computation
• Systolic VLSI Arrays for Polynomial GCD Computation
• An improved Monte Carlo factorization algorithm
• Fast Algorithms for Manipulating Formal Power Series
• Fast parallel matrix and GCD computations
• Unnamed Item
• Unnamed Item

This page was built for publication: A systolic algorithm for extended GCD computation