ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Lazy multiplication of formal power series
Full text PdfPdf (613 KB)
Source International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1997 international symposium on Symbolic and algebraic computation table of contents
Kihei, Maui, Hawaii, United States
Pages: 17 - 20  
Year of Publication: 1997
ISBN:0-89791-875-4
Author
Joris van der Hoeven  LIX, Ecole Polytechnique, 91128 Palaiseau Cedex, France
Sponsors
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 22,   Citation Count: 6
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/258726.258738
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
R. P. Brent , H. T. Kung, Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM (JACM), v.25 n.4, p.581-595, Oct. 1978  [doi>10.1145/322092.322099]
 
2
Robert Sedgewick , Philippe Flajolet, An introduction to the analysis of algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1996
 
3
Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
 
4
PSLYA, G. Kombinatorische Anzahlbestimmungen fiir Gruppen, Graphen und chemische Verbindungen. Acta Mathematica 68 (1937), 145-254.
 
5
SCUSNHAGE, A. Schnelle Multiplikation fiber KSrpern der Charakteristik 2. Acta Inform. 7 (1977), 395-398.

CITED BY  6
Joris Van der Hoeven, Relax, but don't be too lazy, Journal of Symbolic Computation, v.34 n.6, p.479-542, December 2002
Joris van der Hoeven, Relaxed mltiplication using the middle product, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.143-147, August 03-06, 2003, Philadelphia, PA, USA
Laurent Bernardin, On bivariate Hensel and its parallelization, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.96-100, August 13-15, 1998, Rostock, Germany
Joris van der Hoeven, The truncated fourier transform and applications, Proceedings of the 2004 international symposium on Symbolic and algebraic computation, p.290-296, July 04-07, 2004, Santander, Spain
Joris van der Hoeven, Computations with effective real numbers, Theoretical Computer Science, v.351 n.1, p.52-60, 14 February 2006
Joris van der Hoeven, New algorithms for relaxed multiplication, Journal of Symbolic Computation, v.42 n.8, p.792-802, August, 2007

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.4 MATHEMATICAL SOFTWARE
      Subjects: Algorithm design and analysis

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Probabilistic computation


General Terms:
Algorithms, Measurement, Performance, Theory, Verification


Keywords:
algorithm, multiplication, power series

Collaborative Colleagues:
Joris van der Hoeven: colleagues

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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player