Scanning list structures without stacks or tag bits
Author:
- Gary LindstromGLGary Lindstrom
- 1 June 1973
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 2 (2) , 47-51
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- A Space-Efficient List Structure Tracing AlgorithmIEEE Transactions on Computers, 1972
- Fast and read-only algorithms for traversing trees without an auxiliary stackInformation Processing Letters, 1972
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967