ACM Home Page
Please provide us with feedback. Feedback
A nonrecursive list compacting algorithm
Full text PdfPdf (172 KB)
Source
Communications of the ACM archive
Volume 13 ,  Issue 11  (November 1970) table of contents
Pages: 677 - 678  
Year of Publication: 1970
ISSN:0001-0782
Author
C. J. Cheney  Univ. Mathematical Lab, Cambridge, England
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 145,   Citation Count: 109
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/362790.362798
What is a DOI?

ABSTRACT

A simple nonrecursive list structure compacting scheme or garbage collector suitable for both compact and LISP-like list structures is presented. The algorithm avoids the need for recursion by using the partial structure as it is built up to keep track of those lists that have been copied.



CITED BY  109