Thumbnail
Access Restriction
Subscribed

Author Fisher, David A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Space complexity ♦ Copying ♦ List processing ♦ Linear time
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.
Description Affiliation: Institute for Defense Analyses, Arlington, VA (Fisher, David A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 18
Issue Number 5
Page Count 2
Starting Page 251
Ending Page 252


Open content in new tab

   Open content in new tab
Source: ACM Digital Library