SIGN IN
SIGN UP
The accelerated integer GCD algorithm
Full Text:
PDF
Buy this Article
Author:
Kenneth Weber
Kent State Univ., Kent, OH
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 21 Issue 1, March 1995
Pages 111-122
ACM
New York, NY
, USA
table of contents
doi>
10.1145/200979.201042
1995 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 23
· Downloads (cumulative): 696
· Citation Count: 13
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
analysis of algorithms
gcd
integer greatest common divisor
number-theoretic computations
number-theoretic computations
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder