This is being written on the day after the close of ACM 71 as I return to Europe for continuation of an interrupted vacation. Therefore, these remarks are going to be…
September 1971 - Vol. 14 No. 9
Features
Education related to the use of computers in organizations
The ACM Curriculum Committee on Computer Education for Management has been carrying out a study on “Curriculum Development in Management Information Systems…
A efficient bit table technique for dynamic storage allocation of 2″-word blocks
An efficient bit table technique for dynamic storage allocation of 2n-word blocks, which requires a minimized amount of memory for bookkeeping purposes, is described. The…
Canonical structure in attribute based file organization
A new file structure for attribute based retrieval is proposed in this paper. It allows queries involving arbitrary Boolean functions of the attribute-value pairs to be…
A note on best one-sided approximations
In this note we consider the relationship between best approximations and best one-sided approximations for three different measures of goodness of fit. For these…
In the numerical solution of ordinary differential equations, certain implicit linear multistep formulas, i.e. formulas of type ∑kj=0 &agr;jxn+j - h ∑kj=0…
Average binary search length for dense ordered lists
A binary search is effective only when the list searched is ordered. It is efficient only when the list is dense—i.e. when records are in contiguous locations. It…
Comment on Cheney’s list-compaction algorithm
C.J. Cheney [2] implicitly assumes that cells of list storage are self-identifying. Cheney needs this assumption so that his algorithm, when linearly scanning the memory…
