A nonrecursive list moving algorithm
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Combining Algebraic and Algorithmic Reasoning: An Approach to the Schorr-Waite Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
A linear algorithm for copying binary trees using bounded workspace
Communications of the ACM
A fast algorithm for copying list structures
Communications of the ACM
A bounded storage algorithm for copying cyclic structures
Communications of the ACM
Copying cyclic list structures in linear time using bounded workspace
Communications of the ACM
Derivation of efficient DAG marking algorithms
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The variable cell length listprocessor VARLIST
ACM '74 Proceedings of the 1974 annual conference - Volume 1
| Hi-index | 48.28 |
Two new algorithms are presented for list structure copying using bounded workspace. The first, of primarily theoretical interest, shows that without cell tag bits the task can be performed in time n2. The second algorithm, assuming one tag bit in each cell, delivers attractive practical speed. Any noncyclic structure is copied in linear speed, while cyclic structures are copied in average time less than n log n. No foreknowledge of cycle absence is necessary to achieve linear speed. A variation of the second algorithm solves an open problem concerning list structure marking. That result demonstrates that marking can be done in average time n log n without the aid of supplemental tag bits or stacks.