Complexity measures on systems of parallel algorithms

zbMATH Open0546.68029MaRDI QIDQ797990FDOQ797990

Authors: Mark Burgin 

Publication date: 1984

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

Recommendations

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

zbMATH Keywords

complexity measuressystems of parallel algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (8)

• On high level characterization of parallelism
• The Dynamic Parallel Complexity of Computational Circuits
• A method for estimating resources required for implementation of finite algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel computation of invariant measures
• Investigation of program collectives
• Expressibility and Parallel Complexity

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)