C. M. Reeves

According to our database, C. M. Reeves authored at least 12 papers between 1963 and 1987.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of seven.

1987

Chainmail: A Model of First-Fit Memory Allocation.

C. M. Reeves

Comput. J., 1987

1984

A Lumped-State Model of Clustering in Dynamic Storage Allocation.

C. M. Reeves

Comput. J., 1984

Complexity Analyses of Event Set Algorithms.

C. M. Reeves

Comput. J., 1984

1983

Free Store Distribution under Random Fit Allocation: Part 3.

C. M. Reeves

Comput. J., 1983

1980

Free Store Distribution Under Random Fit Allocation: Part 2.

C. M. Reeves

Comput. J., 1980

1979

Free Store Distribution Under Random Fit Allocation: Part 1.

C. M. Reeves

Comput. J., 1979

1967

Description of a syntax-directed translator.

C. M. Reeves

Comput. J., 1967

1966

An algorithm for generating projective reduction formulas for matrix elements of many-electron wavefunctions.

C. M. Reeves

Commun. ACM, 1966

1964

Function minimization by conjugate gradients.

R. Fletcher, C. M. Reeves

Comput. J., 1964

Algorithm 238: Conjugate gradient method.

C. M. Reeves

Commun. ACM, 1964

1963

A Mechanization of Algebraic Differentiation and the Automatic Generation of Formulae for Molecular Integrals of Gaussian Orbitals.

R. Fletcher, C. M. Reeves

Comput. J., 1963

An Application of the Monte Carlo Method to the Evaluation of Some Molecular Integrals.

D. R. Cowdrey, C. M. Reeves

Comput. J., 1963