The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A nonrecursive list compacting algorithm
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
An efficient list-moving algorithm using constant workspace
Communications of the ACM
Copying list structures using bounded workspace
Communications of the ACM
| Hi-index | 48.25 |
An efficient, nonrecursive algorithm is given for moving any LISP-type list. In particular, the algorithm requires no storage other than the new nodes into which the lists is to be moved, and no additional bits per node for marking; the algorithm runs in time proportional to the number of nodes in the list. The original list structure is destroyed as it is moved.