A chained-matrices approach for parallel computation of continued fractions and its applications-Reference-Cited by-同舟云学术

A chained-matrices approach for parallel computation of continued fractions and its applications

Published:1994-03 Issue:1 Volume:9 Page:65-80
ISSN:0885-7474
Container-title:Journal of Scientific Computing
language:en
Short-container-title:J Sci Comput

Author:

Lin Shun-Shii

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Engineering,Theoretical Computer Science,Software,Applied Mathematics,Computational Mathematics,Numerical Analysis

Link

http://link.springer.com/content/pdf/10.1007/BF01573178.pdf

Reference26 articles.

1. Akl, S. G. (1989).The Design and Analysis of Parallel Algorithms, Prentice-Hall, Englewood Cliffs, New Jersey.

2. Bilardi, G., and Preparata, F. P. (1989). Size-time complexity of boolean networks for prefix computations,Journal of the ACM 36(6), 362–382.

3. Brent, R. P. (1974). The parallel evaluation of general arithmetic expressions,Journal of the ACM 21(2), 201–206.

4. Brent, R. P., and Lung, H. T. (1982). A regular layout for parallel adders,IEEE Trans. Comput. C-31(3), 240–264.

5. Carlson, D. A., and Sugla, B. (1984). Time and processor efficient parallel algorithms for recurrence equations and related problems, inProc. Int'l. Conf. on Parallel Processing, pp. 310–314.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deep Learning Network Intrusion Detection Based on Network Traffic;Lecture Notes in Computer Science;2022

2. Maximizing the Parallelism Degree for Optimal Computing of Matrix Chain Products;2017 IEEE/ACS 14th International Conference on Computer Systems and Applications (AICCSA);2017-10

3. On Determining Multiple Optimal Parenthesizations for Matrix Chain Products and Scheduling the Corresponding Task Graphs;2017 International Conference on High Performance Computing & Simulation (HPCS);2017-07