The Complexity of Parallel Evaluation of Linear Recurrences

DOI10.1145/322017.322030MaRDI QIDQ4131022zbMATH OpenOpenAlexFDO

Authors H. T. Kung, Laurent Hyafil

Publication date 1977

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322017.322030

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(10)

• Speedup of linear stationary iteration processes in multiprocessor computers. I
• Parallel prefix computation with few processors
• OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES
• Size-depth trade-offs for monotone arithmetic circuits
• Parallel computations in linear algebra. II
• A parallel algorithm for evaluating general linear recurrence equations
• Efficient parallel algorithms for linear recurrence computation
• Parallel solution of recurrences on a tree machine
• On the numerical evaluation of linear recurrences
• PARALLEL POLYNOMIAL EVALUATION BY DECOUPLING ALGORITHM

This page was built for publication: The Complexity of Parallel Evaluation of Linear Recurrences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131022)