Sign In

Communications of the ACM

Table of Contents

ACM President's Letter: a walking tour of AFIPS

Self-assessment procedure VI

The paradigms of programming

Today I want to talk about the paradigms of programming, how they affect our success as designers of computer programs, how they should be taught, and how they should be embodied in our programming languages.

Computing connected components on parallel computers

We present a parallel algorithm which uses n2 processors to find the connected components of an undirected graph with n vertices in time O(log2n). An O(log2n) time bound also can be achieved using only nn/⌈log2n⌉⌉ processors …

Proving termination with multiset orderings

A common tool for proving the termination of programs is the well-founded set, a set ordered in such a way as to admit no infinite descending sequences. The basic approach is to find a termination function that maps the values …

Secure personal computing in an insecure network

A method for implementing secure personal computing in a network with one or more central facilities is proposed. The method employs a public-key encryption device and hardware keys. Each user is responsible for his own security …

Further remark on stably updating mean and standard deviation estimates

A procedure for sequentially recomputing the mean and standard deviation of a weighted series of numbers as new values are added is given by Hanson [2]. To accommodate the most frequently occurring situation, Cotton [1] expressed …

ACM forum