C.J. Cheney [2] implicitly assumes that cells of list storage are self-identifying. Cheney needs this assumption so that his algorithm, when linearly scanning the memory containing a copy of a list, can determine whether particular bit patterns within that memory are pointers to other list structure. The assumption is strong, and its effect is contrary to that of the list compaction which is his algorithm's purpose.
The Latest from CACM
Shape the Future of Computing
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 InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More
Join the Discussion (0)
Become a Member or Sign In to Post a Comment