Robert R. Fenichel – Communications of the ACM

Research and Advances Sep 1 1971

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 bit patterns within that memory are pointers to other list structure. The assumption is strong, and its effect is contrary to that of the list compaction which is his algorithm's purpose.

Author Archives

Research and Advances Aug 1 1971

List tracing in systems allowing multiple cell-types

List-processing systems have each allowed the use of only a single size and configuration of list cell. In this paper a system is described which allows the use of arbitrarily many different sizes and configurations of list cells, possibly not specified until run time.

Research and Advances May 1 1971

On implementation of label, variables

Research and Advances Mar 1 1970

A program to teach programming

The TEACH system was developed at MIT to ease the cost and improve the results of elementary instruction in programming. To the student, TEACH offers loosely guided experience with a conversational language which was designed with teaching in mind. Faculty involvement is minimal. A term of experience with TEACH is discussed. Pedagogically, the system appears to be successful; straighforward reimplementation will make it economically successful as well. Similar programs of profound tutorial skill will appear only as the results of extended research. The outlines of this research are beginning to become clear.

Research and Advances Nov 1 1969

A LISP garbage-collector for virtual-memory computer systems

Computing Applications

Research and Advances Jun 1 1968

Algorithms: Algorithm 329: Distribution of indistinguishable objects into distinguishable slots

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved