A Space-Efficient List Structure Tracing Algorithm

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.