Communications of the ACM
Communications of the ACM
Solution of polynomial equation by Bairstow-Hitchcock method
Communications of the ACM
Communications of the ACM
Algorithms: Bessel function I, series expansion
Communications of the ACM
Algorithms: evaluation of the Hermite polynomial Hn(X) by recursion
Communications of the ACM
Algorithms: evaluation of the Legendre polynomial Pn(X) by recursion
Communications of the ACM
Algorithms 13: complex exponential integral
Communications of the ACM
Algorithms: Euclidean algorithm
Communications of the ACM
Algorithms: Bessel function I, asymptotic expansion
Communications of the ACM
Natural laws controlling algorithm structure?
ACM SIGPLAN Notices
A Mathematical Theory of Communication
A Mathematical Theory of Communication
Modularization in the pilot compiler and its effect on the length
ACM '76 Proceedings of the 1976 annual conference
Automatic program analysis and evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Foundations and experiments in software science
SCORE '82 Selected papers of the 1982 ACM SIGMETRICS workshop on Software metrics: part 2
“Software reliability in online real time environment”
Proceedings of the international conference on Reliable software
Conservation of software science parameters across modularization
ACM '77 Proceedings of the 1977 annual conference
Toward a theoretical basis for estimating programming effort
ACM '75 Proceedings of the 1975 annual conference
Third generation compiler design
ACM '75 Proceedings of the 1975 annual conference
Experimental validation of a structural property of fortran algorithms
ACM '74 Proceedings of the 1974 annual conference - Volume 1
The automatic measurement of the relative merits of student programs
ACM SIGPLAN Notices
Impurities found in algorithm implementations
ACM SIGPLAN Notices
A study of the structural composition of PL/I programs
ACM SIGPLAN Notices
A recent approach to the study of algorithms
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
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
| Hi-index | 0.00 |
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.