Complexity measures on systems of parallel algorithms

MaRDI QIDQ797990zbMATH OpenFDO

Authors Mark Burgin

Publication date 1984

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

complexity measuressystems of parallel algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Publication:4729359
• Publication:4896252
• Parallel computations on graphs
• scientific article; zbMATH DE number 3986535
• Polynomial estimation of the complexity of algorithms

Cited in

(11)

• A method for estimating resources required for implementation of finite algorithms
• On high level characterization of parallelism
• Designing program structures in artificial intelligence systems by taking their complexity into account
• Complexity of algorithms that construct subsets of data from formal definitions
• scientific article; zbMATH DE number 3856374 (Why is no real title available?)
• Expressibility and Parallel Complexity
• The Dynamic Parallel Complexity of Computational Circuits
• A note on measuring parallelism in concurrent engineering
• scientific article; zbMATH DE number 936824 (Why is no real title available?)
• Parallel computation of invariant measures
• Investigation of program collectives

This page was built for publication: Complexity measures on systems of parallel algorithms

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