A nonrecursive list compacting algorithm

DOI10.1145/362790.362798zbMath0215.28002OpenAlexW2156956446WikidataQ30052898 ScholiaQ30052898MaRDI QIDQ5618219

C. J. Cheney

Publication date: 1970

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/362790.362798

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Theory of computing (68Q99)

Related Items (12)

Unit-cost pointers versus logarithmic-cost addresses ⋮ SICStus Prolog—The first 25 years ⋮ Garbage collection in shared-environment closure reducers: Space-efficient depth first copying using a tailored approach ⋮ Practical Tactics for Separation Logic ⋮ Scheduling of hard real-time garbage collection ⋮ Semantically restricted argument dependencies ⋮ Marking algorithms ⋮ Stop-and-copy and one-bit reference counting ⋮ Higher-Order Separation Logic in Isabelle/HOLCF ⋮ ``V-tape, a virtual memory oriented data type, and its resource requirements ⋮ Genetic order and compactifying garbage collectors ⋮ Real-time MLton: A Standard ML runtime for real-time functional programs

This page was built for publication: A nonrecursive list compacting algorithm