Daniel D. McCracken
Pages 447-448
ACM Committee on Self-Assessment
Pages 449-454
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.
Robert W. Floyd
Pages 455-460
We present a parallel algorithm which uses
n2 processors to find the connected components of an undirected graph with
n vertices in time
O(log
2n). An
O(log
2n) time bound also can be achieved using only
n⌈
n/⌈log
2n⌉⌉ processors …
D. S. Hirschberg, A. K. Chandra, D. V. Sarwate
Pages 461-464
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 …
Nachum Dershowitz, Zohar Manna
Pages 465-476
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 …
Dorothy E. Denning
Pages 476-482
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 …
Lloyd S. Nelson
Page 483
Pages 489-490
