May 1977 - Vol. 20 No. 5
Features
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…
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…
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…
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…
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…
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…
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…