August 1979 - Vol. 22 No. 8
Features
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…
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…
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…
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…
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…