A Space-Efficient List Structure Tracing Algorithm

1 September 1972

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-21 (9), 1009-1010
https://doi.org/10.1109/tc.1972.5009079

Abstract

An algorithm for tracing during garbage collection of list structure is presented. It requires only one bit for each level of doubly branching structure traced. Compared to existing trace algorithms, it generally requires less storage-often, substantially less.

Keywords

PROBABILITY DENSITY FUNCTION
DATA MINING
ROBUSTNESS
BINARY TREES
PATHOLOGY
INSPECTION

This publication has 2 references indexed in Scilit:

An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM, 1967
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM, 1960

Cited by 10 articles