The Complexity of Parallel Evaluation of Linear Recurrences
From MaRDI portal
Publication:4131022
DOI10.1145/322017.322030zbMath0358.68084OpenAlexW2089366856MaRDI QIDQ4131022
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
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (10)
OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES ⋮ PARALLEL POLYNOMIAL EVALUATION BY DECOUPLING ALGORITHM ⋮ A parallel algorithm for evaluating general linear recurrence equations ⋮ Efficient parallel algorithms for linear recurrence computation ⋮ Parallel prefix computation with few processors ⋮ Speedup of linear stationary iteration processes in multiprocessor computers. I ⋮ Parallel computations in linear algebra. II ⋮ Size-depth trade-offs for monotone arithmetic circuits ⋮ Parallel solution of recurrences on a tree machine ⋮ On the numerical evaluation of linear recurrences
This page was built for publication: The Complexity of Parallel Evaluation of Linear Recurrences
