A ultra fast Euclidean division algorithm for prime memory systems

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Benôit Dupont de Dinechin C.E.A., Centre d'Études de Limeil-Valenton, 94195 Villeneuve St Georges cedex, France
Published in:
· Proceeding
Supercomputing '91 Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Pages 56-65
ACM New York, NY, USA ©1991
table of contents ISBN:0-89791-459-7 doi>10.1145/125826.125874
A ultra fast Euclidean division algorithm for prime memory systems Published by ACM 1991 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 352
· Citation Count: 2


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder