1973 · 31 citations · 4 references
ComputingComputer EngineeringComputer ScienceAlgorithmsDynamical SystemsTheory Of ComputationAlgorithm AnalysisAlgorithmic ComplexityAlgorithmic PerformanceComplexity TheoryComputational ComplexityComputational ModelsComputational Complexity Of Algorithms
A technique for measuring simple structural properties of algorithms is described. Using these measures, it is found that for a non-trivial class of algorithms there is a quantitative relationship between operators and operands and their usage. Properties of “Full” and “Reduced” algorithms are then explored, and shown to predict the quantitative relationship observed.
4
An empirical study of FORTRAN programs
Donald E. Knuth · Software Practice and Experience · 1971 · 682 citations
The FORTRAN automatic coding system
John Backus, Hermann Stern, I. Ziller et al. · 1957 · 190 citations
Natural laws controlling algorithm structure?
M. H. Halstead · ACM SIGPLAN Notices · 1972 · 94 citations
Computing, Physics, Algorithms +5