ACM '73 Proceedings of the ACM annual conference
Invariant properties of algorithms.
Invariant properties of algorithms.
Natural laws controlling algorithm structure?
ACM SIGPLAN Notices
Impurities found in algorithm implementations
ACM SIGPLAN Notices
Language level, a missing concept in information theory
ACM SIGMETRICS Performance Evaluation Review
A Review and Evaluation of Software Science
ACM Computing Surveys (CSUR)
Modularization in the pilot compiler and its effect on the length
ACM '76 Proceedings of the 1976 annual conference
Toward a theoretical basis for estimating programming effort
ACM '75 Proceedings of the 1975 annual conference
An experiment comparing Fortran programming times with the software physics hypothesis
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
A critical examination of software science
Journal of Systems and Software
| Hi-index | 0.00 |
Recent studies [1,3,8,9] have shown that theory predicts, and limited experimental data confirm, the existence of a functional relationship between the length, N, of the expression of an algorithm and the number of distinct operators, n1,and of distinct operands, n2,required to express that algorithm in various languages. Data previously examined, however, was restricted to a small sample of rather short, published algorithms, for which n1,n2and N could be measured manually.