Garbage Collection of Linked Data Structures
- 1 September 1981
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 13 (3), 341-367
- https://doi.org/10.1145/356850.356854
Abstract
No abstract availableThis publication has 60 references indexed in Scilit:
- Managing Reentrant Structures Using Reference CountsACM Transactions on Programming Languages and Systems, 1980
- List processing in real time on a serial computerCommunications of the ACM, 1978
- Shifting garbage collection overhead to compile timeCommunications of the ACM, 1977
- A note on hash linkingCommunications of the ACM, 1975
- Areas and record-classesThe Computer Journal, 1975
- Optimal use of storage in a simple model of garbage collectionInformation Processing Letters, 1974
- Garbage collection for virtual memory computer systemsCommunications of the ACM, 1972
- Implementing the ALGOL 68 heapBIT Numerical Mathematics, 1970
- A note on the efficiency of a LISP computation in a paged machineCommunications of the ACM, 1968
- Structure of a LISP system using two-level storageCommunications of the ACM, 1967