A nonrecursive list compacting algorithm

DOI10.1145/362790.362798MaRDI QIDQ5618219zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5618219)