skip to main content
column

Towards parallel general-size library generation for polynomial multiplication

Published: 28 January 2014 Publication History

Abstract

No abstract available.

References

[1]
L. Meng, J. Johnson. Automatic Parallel Library Generation for General-Size Modular FFT Algorithms. To appear in Proc. of the CASC 2013, 2013
[2]
L. Meng, J. Johnson, F. Franchetti, Y. Voronenko,M. Moreno Maza and Y. Xie. Spiral-Generated Modular FFT Algorithms. In Proc. of PASCO 2010, p. 169--170, 2010.
[3]
X. Li and M. Moreno Maza: Efficient implementation of polynomial arithmetic in a multiple-level programming environment. In Proc. Intl. Congress of Mathematical Software, p. 12--23, Springer, 2006.
[4]
Y. Voronenko. Library Generation for Linear Transforms. PhD. thesis, Electrical and Computer Engineering, Carnegie Mellon University, 2008

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Communications in Computer Algebra
ACM Communications in Computer Algebra  Volume 47, Issue 3/4
September/December 2013
116 pages
ISSN:1932-2232
EISSN:1932-2240
DOI:10.1145/2576802
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 January 2014
Published in SIGSAM-CCA Volume 47, Issue 3/4

Check for updates

Qualifiers

  • Column

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 45
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media