Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers

SIAM Journal on Computing - United States
doi 10.1137/0216002
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

On the Greatest Common Divisor of the Value of Two Polynomials

American Mathematical Monthly
Mathematics
2017English

The Divisor Problem for ( K, R) — Integers

Journal of the Australian Mathematical Society
1973English

A GPU Implementation of a Bit-Parallel Algorithm for Computing the Longest Common Subsequence

IPSJ Online Transactions
2014English

A Parallel Algorithm for Computing Fourier Transforms on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1994English

Mining Frequent Itemset Using Parallel Computing Apriori Algorithm

International Journal of Innovative Research in Computer and Communication Engineering
2014English

Sublinear-Time Parallel Algorithms for Matching and Related Problems

1988English

New Prime Factorization Algorithm and Its Parallel Computing Strategy

2016English

A Parallel Computing Algorithm for Moving Targets Tracking in Wireless Sensor Networks

2016English

A Space-Efficient Parallel Algorithm for Computing Betweenness Centrality in Distributed Memory

2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy