A bounded storage algorithm for copying cyclic structures

Authors:
J. M. Robson
Affiliations:
Univ. of Lancaster, Lancaster, England
Venue:
Communications of the ACM
Year:
1977

Citing 2
Cited 8

Copying cyclic list structures in linear time using bounded workspace

Communications of the ACM
Copying list structures using bounded workspace

Communications of the ACM

A bibliography on garbage collection and related topics

ACM SIGPLAN Notices
Garbage Collection of Linked Data Structures

ACM Computing Surveys (CSUR)
Analysis of pointer “rotation”

Communications of the ACM
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
Derivation of efficient DAG marking algorithms

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Analysis of pointer rotation

POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The evolution of list-copying algorithms and the need for structured program verification

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Quantified Score

Hi-index	48.26

Visualization

Abstract

A new algorithm is presented which copies cyclic list structures using bounded workspace and linear time. Unlike a previous similar algorithm, this one makes no assumptions about the storage allocation system in use and uses only operations likely to be available in a high-level language. The distinctive feature of this algorithm is a technique for traversing the structure twice, using the same spanning tree in each case, first from left to right and then from right to left.