Communications of the ACM

ACM vice-president's letter: a time to preserve the past

Dan McCracken
Page 295

---

Self-assessment procedure II

ACM Committee on Self-Assessment
Pages 297-300

---

SP/k: a system for teaching computer programming

SP/k is a compatible subset of the PL/I language that has been designed for teaching programming. The features of the SP/k language were chosen to encourage structured problem solving by computers, to make the language easy to … R. C. Holt, D. B. Wortman, D. T. Barnard, J. R. Cordy
Pages 301-309

---

Achieving specific accuracy in simulation output analysis

This paper extends the use of the regenerative property of queueing systems in the analysis of simulation output. In particular, it describes a sequential estimation method which when used with the regenerative property allows … George S. Fishman
Pages 310-315

---

Optimal program and data locations in computer networks

An optimization procedure for the allocation of program and data files in a computer network is presented. This algorithm takes into account the dependencies between files and programs such as occur in real heterogeneous computer … Howard L. Morgan, K. Dan Levin
Pages 315-322

---

A comparison of tree-balancing algorithms

Several algorithms — height-balance (i.e. AVL and extensions), weight-balance (i.e. BB and WB), and total restructuring — for building balanced binary search trees are compared. The criteria for comparison encompass theoretical … J.-L. Baer, B. Schwab
Pages 322-330

---

A comparison of hardware and software associative memories in the context of computer graphics

The Associative Processing of Line Drawings (APLD) System utilizes a hardware associative memory and creates, modifies, deletes, stores, and retrieves two-dimensional line drawings consisting of points, lines, rectangles, and … Neil J. Stillman, P. Bruce Berra
Pages 331-339

---

The choice of reference points in best-match file searching

Improvements to the exhaustive search method of best-match file searching have previously been achieved by doing a preprocessing step involving the calculation of distances from a reference point. This paper discusses the proper … Marvin Shapiro
Pages 339-343

---

An optimal evaluation of Boolean expressions in an online query system

Michael Z. Hanani
Pages 344-347

---

An approach to optimal design of storage parameters in databases

Y. Milman
Pages 347-350

---

A fast algorithm for computing longest common subsequences

Previously published algorithms for finding the longest common subsequence of two sequences of length n have had a best-case running time of O(n2). An algorithm for this problem is presented which has a running time of O((r + … James W. Hunt, Thomas G. Szymanski
Pages 350-353

---

ACM forum

Robert L. Ashenhurst
Pages 362-366

---