A space-efficient list structure tracing algorithm

Authors:
Ben Wegbreit
Affiliations:
Center for Research in Computing Technology, Harvard University, Cambridge, Mass.
Venue:
IEEE Transactions on Computers
Year:
1972

Citing 2
Cited 1

An efficient machine-independent procedure for garbage collection in various list structures

Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM

Recent developments in the theory of data structures

Computer Languages

Quantified Score

Hi-index	14.98

Visualization

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.