Sign In

Communications of the ACM

Table of Contents


ACM 71: a suggestion

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 short, and they will not, of course, do justice to the results …

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 Education in Colleges and Universities” under a grant from the National …

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 technique has been tested in an implementation of the6 …

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 processed without taking intersections of lists. The structure …

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 measures simple relationships exist between best approximations …

A stopping criterion for the Newton-Raphson method in implicit multistep integration algorithms for nonlinear systems of ordinary differential equations

In the numerical solution of ordinary differential equations, certain implicit linear multistep formulas, i.e. formulas of type ∑kj=0 &agr;jxn+j - hkj=0 &bgr;jxn+j = 0, (1) with &bgr;k> ≠ 0, have long been favored because they exhibith …

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 is easy to show that the maximum number of looks for a searchL …

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 containing a copy of a list, can determine whether particular …

ACM forum

It is hard to recruit ACM members when there is no demonstrable relationship between membership and employment. Employers who recruit actuaries and accountants often specify the recognition applicants must have won from the relevant …