ACM Home Page
Please provide us with feedback. Feedback
A note on Cheney's nonrecursive list-compacting algorithm
Full text PdfPdf (50 KB)
Source
Communications of the ACM archive
Volume 15 ,  Issue 4  (April 1972) table of contents
Page: 275  
Year of Publication: 1972
ISSN:0001-0782
Author
David C. Walden  Bolt Beranek and Newman Inc., Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Citation Count: 2
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/361284.361300
What is a DOI?

ABSTRACT

Cheney's list-compacting algorithm [1] goes into an infinite loop when it traces a circular list consisting exclusively of non-items. While it may be reasonable to say that such lists should not exist, it would be very difficult to legislate out of existence programs which illegally create such lists because of bugs, and it would not do for the garbage collector to break down in this instance.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1