An improved systolic algorithm for the algebraic path problem
From MaRDI portal
Recommendations
- Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
- scientific article; zbMATH DE number 4003535
- scientific article; zbMATH DE number 64177
- A block algorithm and optimal fixed-size systolic array processor for the algebraic path problem
- scientific article; zbMATH DE number 3954292
Cited in
(16)- Derivation of systolic algorithms for the algebraic path problem by recurrence transformations
- Algorithms for algebraic path properties in concurrent systems of constant treewidth components
- scientific article; zbMATH DE number 3954292 (Why is no real title available?)
- scientific article; zbMATH DE number 4058886 (Why is no real title available?)
- Systolic algorithms for the dynamic programming problem
- scientific article; zbMATH DE number 64177 (Why is no real title available?)
- A family of efficient regular arrays for algebraic path problem
- scientific article; zbMATH DE number 4003535 (Why is no real title available?)
- SYSTOLIC MATRIX INVERSION USING A MONTE CARLO METHOD
- scientific article; zbMATH DE number 7623648 (Why is no real title available?)
- Subspace scheduling and parallel implementation of non-systolic regular iterative algorithms
- A block algorithm and optimal fixed-size systolic array processor for the algebraic path problem
- On the optimality of linear schedules
- scientific article; zbMATH DE number 4185046 (Why is no real title available?)
- Systolic algorithms for some scheduling and graph problems
- An incremental mechanical development of systolic solutions to the algebraic path problem
This page was built for publication: An improved systolic algorithm for the algebraic path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136230)