Affiliation:
1. Univ. of Lancaster, Lancaster, England
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.
Publisher
Association for Computing Machinery (ACM)
Reference3 articles.
1. Copying list structures using bounded workspace
2. Copying cyclic list structures in linear time using bounded workspace
3. Woodward P.M. and Bond S.G. Algol 68-R Users' Guide. Her Majesty's Stationery Office London England 1974. Woodward P.M. and Bond S.G. Algol 68-R Users' Guide. Her Majesty's Stationery Office London England 1974.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献