The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Garbage Collection of Linked Data Structures
Abstract
A concise and unified view of the numerous existing algorithms for performing garbage collection of linked data structures is presented. The emphasm is on garbage collection proper, rather than on storage allocatlon. First, the classical garbage collection algorithms are reviewed, and their marking and collecting phases, with and without compacting, are discussed. Algorithms descnbing these phases are classified according to the type of cells to be collected: those for collecting single-sized cells are simpler than those for varimzed cells. Recently proposed algorithms are presented and compared with the classical ones. Special topics in garbage collection are also covered: the use of secondary and virtual storage, the use of reference counters, parallel and real-time collections, analyses of garbage collection algorithms, and language features whlch influence the design of collectors. The bibhography, wlth topical annotations, contains over 100 references.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ross, D. T. (1967) · Communications of the ACM · doi:10.1145/363534.363546 · Cited by 78
Cited by
Collaboration Processes: Inside the Black Box
Thomson, A. M., & Perry, J. L. (2006) · Public Administration Review · doi:10.1111/j.1540-6210.2006.00663.x · Cited by 1,386
Garbage collection in an uncooperative environment
Boehm, H., & Weiser, M. (1988) · Software: Practice and Experience · doi:10.1002/spe.4380180902 · Cited by 627
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
Ungar, D. (1984) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/390010.808261 · Cited by 484
Performance and Evaluation of LISP Systems
Gabriel, R. P. (1985) · The MIT Press eBooks · doi:10.7551/mitpress/5298.001.0001 · Cited by 270
Metadata
- Authors
- Cohen, J.
- Venue
- ACM Computing Surveys
- Published
- 1981-09
- Volume
- 13
- Issue
- 3
- Pages
- 341-367
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2076878931
- Cited by
- 218
- References
- 1
- FWCI
- 8.68
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Garbage Collection of Linked Data Structures. https://app.cochat.ai/papers/10.1145/356850.356854
- The paper
- Cohen, J. (1981). Garbage Collection of Linked Data Structures. ACM Computing Surveys. https://doi.org/10.1145/356850.356854
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.