On the parallel complexity of solving recurrence equations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3954267
- Parallel solution of recurrences on a tree machine
- On Efficient Parallel Algorithms for Solving Set Recurrence Equations
- scientific article; zbMATH DE number 54587
- \(K\)-dimensional optimal parallel algorithm for the solution of a general class of recurrence equations
Cited in
(14)- Complexity of preprocessing of recursive filters for running in parallel
- On time optimal implementation of uniform recurrences onto array processors via quadratic programming
- \(K\)-dimensional optimal parallel algorithm for the solution of a general class of recurrence equations
- Solutions of two minmax recurrences in parallel processing with variable recombination overhead
- scientific article; zbMATH DE number 5885666 (Why is no real title available?)
- Parallel solution of recurrences on a tree machine
- scientific article; zbMATH DE number 3954267 (Why is no real title available?)
- scientific article; zbMATH DE number 54587 (Why is no real title available?)
- On Efficient Parallel Algorithms for Solving Set Recurrence Equations
- scientific article; zbMATH DE number 2006627 (Why is no real title available?)
- Upper and lower bounds for recurrent and recursively decomposable parallel processor‐networks
- New results on computability of recurrence equations
- Scheduling a system of nonsingular affine recurrence equations onto a processor array
- Computability of recurrence equations
This page was built for publication: On the parallel complexity of solving recurrence equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525737)
