A Fortran-Compiled List-Processing Language
Journal of the ACM (JACM)
The use of threaded lists in constructing a combined ALGOL and machine-like assembly processor
Communications of the ACM
A generalized technique for symbol manipulation and numerical calculation
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
A list-type storage technique for alphanumeric information
Communications of the ACM
Communications of the ACM
Communications of the ACM
Outline for a multi-list organized system
ACM '59 Preprints of papers presented at the 14th national meeting of the Association for Computing Machinery
Dynamic memory allocation in computer simulation
Communications of the ACM
Automated printed circuit routing with a stepping aperture
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
Communications of the ACM
Complex information processing: a file structure for the complex, the changing and the indeterminate
ACM '65 Proceedings of the 1965 20th national conference
A garbage collection policy based on empirical behavior
Information Sciences—Informatics and Computer Science: An International Journal
On the structure of dictionaries for compilers
ACM SIGPLAN Notices
Data layouts for object-oriented programs
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Simple Hardware Buddy System Memory Allocator
IEEE Transactions on Computers
Beyond reachability: shape abstraction in the presence of pointer arithmetic
SAS'06 Proceedings of the 13th international conference on Static Analysis
A study of dynamic memory management in C++ programs
Computer Languages, Systems and Structures
| Hi-index | 48.28 |
The list concept as originally proposed by Newell, Simon and Shaw specified single computer words as elements of a list. This report describes the use of two or more consecutive words as one element. Such use results in a considerable saving in both the space required to hold a given amount of data, and in the execution time required to perform a given process on the data.Following a brief description of standard list structures with single-word items, the multiword items are introduced. Then variable-length items are described, along with the corresponding space-utilization problems. Finally, several examples are given to illustrate the use of multiword lists.This paper attempts to draw together various recent papers which have applied some of these concepts in different ways, and indicate how they relate to the more general problem.