Jean E. Sammet
Pages 484-485
A real time garbage collection system avoids suspending the operations of a list processor for the long times that garbage collection normally requires by performing garbage collection on a second processor in parallel with list …
Philip L. Wadler
Pages 491-500
The worst-case, minimum number of comparisons complexity V
i(n) of the i-th selection problem is considered. A new upper bound for V
i(n) improves the bound given by the standard Hadian-Sobel algorithm by a generalization of the …
Chee K. Yap
Pages 501-508
The nodes of a weighted derivation tree are associated with weighting functions over the vocabulary of a context-free grammar. An algorithm is presented for constructing the optimal derivation tree having the same structure as …
Michael C. Loui
Pages 509-513
A relatively simple method for the detection of recursive use of procedures is presented for use in compiler optimization. Implementation considerations are discussed, and a modification of the algorithm is given to further improve …
Kenneth G. Walter
Pages 514-516
Algorithms are presented to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code. Both algorithms are efficient in that the time required to generate the next element from the current one is …
James R. Bitner, Gideon Ehrlich, Edward M. Reingold
Pages 517-521
This paper describes a new way of solving the storage reclamation problem for a system such as Lisp that allocates storage automatically from a heap, and does not require the programmer to give any indication that particular
…
L. Peter Deutsch, Daniel G. Bobrow
Pages 522-526
Context trees provide a convenient way of storing data which is to be viewed as a hierarchy of contexts. This note presents an algorithm which improves on previous context tree retrieval algorithms. It is based on the observation …
Ben Wegbreit
Pages 526-529
Pages 533-534
