1987 | ||
---|---|---|
8 | C. M. Reeves: Chainmail: A Model of First-Fit Memory Allocation. Comput. J. 30(3): 201-213 (1987) | |
1984 | ||
7 | C. M. Reeves: Complexity Analyses of Event Set Algorithms. Comput. J. 27(1): 72-79 (1984) | |
6 | C. M. Reeves: A Lumped-State Model of Clustering in Dynamic Storage Allocation. Comput. J. 27(2): 135-142 (1984) | |
1983 | ||
5 | C. M. Reeves: Free Store Distribution under Random Fit Allocation: Part 3. Comput. J. 26(1): 25-35 (1983) | |
1980 | ||
4 | C. M. Reeves: Free Store Distribution Under Random Fit Allocation: Part 2. Comput. J. 23(4): 298-306 (1980) | |
1979 | ||
3 | C. M. Reeves: Free Store Distribution Under Random Fit Allocation: Part 1. Comput. J. 22(4): 346-351 (1979) | |
1966 | ||
2 | EE | C. M. Reeves: An algorithm for generating projective reduction formulas for matrix elements of many-electron wavefunctions. Commun. ACM 9(4): 276-279 (1966) |
1964 | ||
1 | EE | C. M. Reeves: Algorithm 238: Conjugate gradient method. Commun. ACM 7(8): 481 (1964) |