A nonrecursive list compacting algorithm
Communications of the ACM · 1970 · 390 citations · 2 references
Computational Complexity TheoryEngineeringAlgorithmic Information TheoryComputer EngineeringGarbage CollectorComputational ComplexityComputer ScienceLisp-like List StructuresDiscrete MathematicsPartial StructureCombinatorial OptimizationDiscrete StructureGarbage CollectionNonrecursive List
A simple nonrecursive list structure compacting scheme or garbage collector suitable for both compact and LISP-like list structures is presented. The algorithm avoids the need for recursion by using the partial structure as it is built up to keep track of those lists that have been copied.
2
A LISP garbage-collector for virtual-memory computer systems
Robert R. Fenichel, Jerome C. Yochelson · Communications of the ACM · 1969
245 citations
Wilfred J. Hansen · Communications of the ACM · 1969
Data RepresentationEngineeringCompact List Representation+21
46 citations