ACM Home Page
Please provide us with feedback. Feedback
An efficient garbage compaction algorithm
Full text PdfPdf (1.02 MB)
Source
Communications of the ACM archive
Volume 25 ,  Issue 8  (August 1982) table of contents
Pages: 571 - 580  
Year of Publication: 1982
ISSN:0001-0782
Author
Johannes J. Martin  Virginia Polytechnic Institute, Blacksburg
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 26,   Citation Count: 4
Additional Information:

references   cited by   index terms  

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/358589.358625
What is a DOI?

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
Fisher, D.A. Bounded workspace garbage collection in an address-order preserving list processing environment. Inf. Process. Left. 3, 1 (July 1974), 29-32.
 
2
Horowitz, E., and Sahni, S. Fundamentals of data structures. Computer Science Press, Inc., Woodland Hills, CA, 1976.
 
3
Jonkers, H.B.M. A fast garbage compaction algorithm. Inf. Process. Lett. 9, 1 (July 20, 1979), 26-30.
4
 
5
Morris, F.L. On a comparison of garbage collection techniques. Comm. ACM, 22, 10 (Oct. 1979), 571.
6
7