DISC ACCESS ALGORITHMS

[1] ASHRAF J, 1970, THESIS QUEENS U BELF

[2] BREWER S, 1968, 23 P NAT C ACM, P623

[3] DESMONDE WH, 1964, REAL TIME DATA PROCE, pCH9

[4] DIPPEL G, 1969, INFORMATION SYSTEMS, P205

[5] Higgins L. D., 1969, Program, V3, P147, DOI 10.1108/eb046612

[6] HIGGINS LD, 1969, THESIS QUEENS U BELF

[7] MARTIN J, 1967, DESIGN REAL TIME COM, pCH26

[8] AN IMPROVED HASH CODE FOR SCATTER STORAGE [J]. COMMUNICATIONS OF THE ACM, 1968, 11 (01) : 35 - &

[9] SCATTER STORAGE TECHNIQUES [J]. COMMUNICATIONS OF THE ACM, 1968, 11 (01) : 38 - &

[10] ADDRESSING FOR RANDOM-ACCESS STORAGE [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1957, 1 (02) : 130 - 146

[1] ASHRAF J, 1970, THESIS QUEENS U BELF

[2] BREWER S, 1968, 23 P NAT C ACM, P623

[3] DESMONDE WH, 1964, REAL TIME DATA PROCE, pCH9

[4] DIPPEL G, 1969, INFORMATION SYSTEMS, P205

[5] Higgins L. D., 1969, Program, V3, P147, DOI 10.1108/eb046612

[6] HIGGINS LD, 1969, THESIS QUEENS U BELF

[7] MARTIN J, 1967, DESIGN REAL TIME COM, pCH26

[8] AN IMPROVED HASH CODE FOR SCATTER STORAGE [J]. COMMUNICATIONS OF THE ACM, 1968, 11 (01) : 35 - &

[9] SCATTER STORAGE TECHNIQUES [J]. COMMUNICATIONS OF THE ACM, 1968, 11 (01) : 38 - &

[10] ADDRESSING FOR RANDOM-ACCESS STORAGE [J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1957, 1 (02) : 130 - 146