论文信息 - Algorithm dynamics

Algorithm dynamics

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.

Rudolf Bayer | Maurice H. Halstead

[1] Joseph Henry Wegstein. Algorithms: rootfinder , 1960, CACM.

[2] Dorothea S. Clarke. Algorithms: Bessel function I, asymptotic expansion , 1960, CACM.

[3] J. W. Backus,et al. The FORTRAN automatic coding system , 1899, IRE-AIEE-ACM '57 (Western).

[4] Dorothea S. Clarke. Algorithms: Bessel function I, series expansion , 1960, CACM.

[5] Saul Gorn. Algorithms: bisection routine , 1960, CACM.

[6] G. M. Galler. Algorithms: evaluation of the Chebyshev polynomial Tn(X) by recursion , 1960, CACM.

[7] D. Whiffen. Thermodynamics , 1973, Nature.

[8] A. Beam. Algorithms 13: complex exponential integral , 1960, CACM.

[9] A. A. Grau. Solution of polynomial equation by Bairstow-Hitchcock method , 1960, CACM.

[10] J. M. Stroud. THE FINE STRUCTURE OF PSYCHOLOGICAL TIME , 1967 .

[11] R. J. Herbold. Algorithms: QuadI , 1960, CACM.

[12] Donald E. Knuth,et al. An empirical study of FORTRAN programs , 1971, Softw. Pract. Exp..

[13] Robert Claussen. Algorithms: Euclidean algorithm , 1960, CACM.

[14] M. H. Halstead,et al. Natural laws controlling algorithm structure? , 1972, SIGP.