Copying cyclic list structures in linear time using bounded workspace

Authors:
David A. Fisher
Affiliations:
Institute for Defense Analyses, Arlington, VA
Venue:
Communications of the ACM
Year:
1975

Citing 1
Cited 11

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)
A Value Transmission Method for Abstract Data Types

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
An efficient list-moving algorithm using constant workspace

Communications of the ACM
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
A brief account: Implementation and applications of a Pascal program verifier (Position Statement)

ACM '78 Proceedings of the 1978 annual conference - Volume 2
Reducing generational copy reserve overhead with fallback compaction

Proceedings of the 5th international symposium on Memory management
Recent developments in the theory of data structures

Computer Languages

Quantified Score

Hi-index	48.28

Visualization

Abstract

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 bounded workspace copying algorithms achieved n2 time without tag bits and n log n time with one tag. The only restriction on the algorithm given here is that the copy must be placed into a contiguous section of memory. The method is applicable to fixed or variable size nodes.