Herbert R. J. Grosch
Page 439
A one-sided height-balanced tree is a binary tree in which every node's right subtree has a height which is equal to or exactly one greater than the height of its left subtree. It has an advantage over the more general AVL tree …
S. H. Zweben, M. A. McDonald
Pages 441-445
The problem of selecting data items from a binary search tree according to a list of range conditions is considered. The process of visiting a minimal number of nodes to retrieve data satisfying the range conditions is called …
James R. Driscoll, Y. Edmund Lien
Pages 445-447
This paper describes an approach for determining the minimum, maximum, and average times to parse sentences acceptable by a deterministic parser. These quantities are presented in the form of symbolic formulas, called time-formulas …
Jacques Cohen, Martin S. Roth
Pages 448-458
In this paper we present a scheme for detecting and recovering from syntax errors in programs. The scheme, which is based on LR parsing, is driven by information which is directly and automatically obtainable from the information …
M. Dennis Mickunas, John A. Modry
Pages 459-465
Maintenance and enhancement of application software consume a major portion of the total life cycle cost of a system. Rough estimates of the total systems and programming resources consumed range as high as 75-80 percent in each …
B. P. Lientz, E. B. Swanson, G. E. Tompkins
Pages 466-471
The purpose of this research was to examine the relationship between processing characteristics of programs and experience characteristics of programmers and program development time. The ultimate objective was to develop a technique …
Earl Chrysler
Pages 472-483
The impacts of an automated client-tracking system on the clients, caseworkers, administrators, and operations of the welfare agencies that use it are reported. The major impact of this system was to enhance the administrative …
Rob Kling
Pages 484-493
A mathematical model of a transaction-oriented system under intermittent failures is proposed. The system is assumed to operate with a checkpointing and rollback/recovery method to ensure reliable information processing. The
…
E. Gelenbe, D. Derochette
Pages 493-499
General equations are derived for estimating the maximum possible utilization of main storage partitions, CPU and I/O devices under different conditions in an idealized CPU-I/O overlap model of multiprogrammed computer systems …
Toby J. Teorey
Pages 500-507
Robert L. Ashenhurst
Pages 511-515
