Herbert R. J. Grosch
Pages 109-110
ACM Committee on Self-Assessment
Pages 111-114
The results of a survey conducted in the fall of 1975 to determine the status of women and minority faculty members in academic computer science are presented. Faculty members were compared with respect to professional background …
Sandra A. Mamrak, Richard G. Montanelli
Pages 115-119
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: (1) Couriers or other secure means …
R. L. Rivest, A. Shamir, L. Adleman
Pages 120-126
The recursion removal algorithm presented by Strong and Walker is amplified and applied to a relatively complex PL/I program. The aim is to demonstrate systematic recursion-removal techniques on something more complex than Knuth's …
M. A. Auslander, H. R. Strong
Pages 127-134
Kellerman has presented a method for determining keyword conflicts and described a heuristic algorithm which solves a certain combinatorial optimization problem in connection with this method. This optimization problem is here …
L. T. Kou, L. J. Stockmeyer, C. K. Wong
Pages 135-139
The B-tree and its variants have, with increasing frequency, been proposed as a basic storage structure for multiuser database applications. Here, three potential problems which must be dealt with in such a structure that do
…
Gerald Held, Michael Stonebraker
Pages 139-143
This paper presents several numerical methods which may be used to obtain the stationary probability vectors of Markovian models. An example of a nearly decomposable system is considered, and the results obtained by the different …
William J. Stewart
Pages 144-152
The problem of recovering an image (a function of two variables) from experimentally available integrals of its grayness over thin strips is of great importance in a large number of scientific areas. An important version of the …
Gabor T. Herman, Arnold Lent, Peter H. Lutz
Pages 152-158
This note describes two operators that respond to step edges, but not to ramps. The first is similar to the digital Laplacian, but uses the max, rather than the sum, of the
x and
y second differences. The second uses the difference …
Bruce J. Schachter, Azriel Rosenfeld
Pages 172-176
Robert L. Ashenhurst
Pages 184-186
This paper explores a technique for proving the correctness and termination of programs simultaneously. This approach, the
intermittent-assertion method, involves documenting the program with assertions that must be true at some …
Zohar Manna, Richard Waldinger
Pages 159-172
