Copying cyclic list structures in linear time using bounded workspace

DOI10.1145/360762.360764MaRDI QIDQ4055175zbMATH OpenOpenAlexFDO

Authors David A. Fisher

Publication date 1975

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited in

(2)

• A fast algorithm for copying binary trees
• A fast compactifying garbage collector

This page was built for publication: Copying cyclic list structures in linear time using bounded workspace

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