scientific article; zbMATH DE number 936824

MaRDI QIDQ4896252zbMATH OpenFDO

Authors Monica Ciaca

Publication date 16 December 1996

zbMATH Keywords

complexitydistributed programs

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Theory of software (68N99)

Recommendations

• Complexity measures for concurrent programs based on information- theoretic metrics
• scientific article; zbMATH DE number 3924114
• Measuring concurrency of regular distributed computations
• A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
• Complexity measures on systems of parallel algorithms

Cited in

(10)

• Coupling coefficients of a distributed execution
• Complexity measures for concurrent programs based on information- theoretic metrics
• Applying Mccabe's complexity measure to multiple-exit programs
• Cyclomatic complexity for generalized nets
• scientific article; zbMATH DE number 3924114 (Why is no real title available?)
• A COMPARISON OF A NEW MEASURE OF LOGICAL COMPLEXITY OF PROGRAMS WITH THE HALSTEAD AND McCABE METHODS
• Information-theoretic Complexity of Program Specifications
• Measure of parallelism of distributed computations
• Measuring concurrency of regular distributed computations
• Complexity measures on systems of parallel algorithms

This page was built for publication:

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