Copying cyclic list structures in linear time using bounded workspace

DOI10.1145/360762.360764zbMath0301.68041OpenAlexW2092816829MaRDI QIDQ4055175

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)

Related Items (2)

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

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