An efficient list-moving algorithm using constant workspace
Author:
Open Access
- 1 June 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 19 (6) , 352-356
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- An empirical study of list structure in LispCommunications of the ACM, 1977
- An efficient, incremental, automatic garbage collectorCommunications of the ACM, 1976
- Copying cyclic list structures in linear time using bounded workspaceCommunications of the ACM, 1975
- A nonrecursive list moving algorithmCommunications of the ACM, 1973
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970
- A LISP garbage-collector for virtual-memory computer systemsCommunications of the ACM, 1969
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967
- Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 1960