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