The DOI matches its Crossref record.
A method for overlapping and erasure of lists
Open accessAbstract
An important property of the Newell Shaw-Simon scheme for computer storage of lists is that data having multiple occurrences need not be stored at more than one place in the computer. That is, lists may be “overlapped.” Unfortunately, overlapping poses a problem for subsequent erasure. Given a list that is no longer needed, it is desired to erase just those parts that do not overlap other lists. In LISP, McCarthy employs an elegant but inefficient solution to the problem. The present paper describes a general method which enables efficient erasure. The method employs interspersed reference counts to describe the extent of the overlapping.
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
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
List processing in real time on a serial computer
Baker, H. G. (1978) · Communications of the ACM · doi:10.1145/359460.359470 · Cited by 592
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
Perceus: garbage free reference counting with reuse
Reinking, A., Xie, N., de Moura, L., & Leijen, D. (2021) · Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation · doi:10.1145/3453483.3454032 · Cited by 32
Metadata
- Authors
- Collins, G. E.
- Venue
- Communications of the ACM
- Published
- 1960-12
- Volume
- 3
- Issue
- 12
- Pages
- 655-657
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W1965601529
- Cited by
- 310
- References
- 0
- FWCI
- 3.67
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A method for overlapping and erasure of lists. https://app.cochat.ai/papers/10.1145/367487.367501
- The paper
- Collins, G. E. (1960). A method for overlapping and erasure of lists. Communications of the ACM. https://doi.org/10.1145/367487.367501
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.
