Copying cyclic list structures in linear time using bounded workspace
A bounded workspace copying algorithm for arbitrary list structures is given. This algorithm operates in linear time and does not require tag bits. The best previous…
Copying cyclic list structures in linear time using bounded workspace
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved