Name
Abstract | ||
|---|---|---|
An efficient, nonrecursive algorithm is given for moving any LISP-type list. In particular, the algorithm requires no storage other than the new nodes into which the lists is to be moved, and no additional bits per node for marking; the algorithm runs in time proportional to the number of nodes in the list. The original list structure is destroyed as it is moved. |
Year | DOI | Venue |
|---|---|---|
1973 | 10.1145/362041.362200 | Commun. ACM |
Keywords | Field | DocType |
lisp-type list,new node,nonrecursive algorithm,original list structure,list copying,list moving,list traversal,lisp,additional bit,garbage collection,nonrecursive list | Association list,Free list,Unrolled linked list,Linked list,List,List update problem,Computer science,Algorithm,Theoretical computer science,Self-organizing list,Linear search | Journal |
Volume | Issue | ISSN |
16 | 5 | 0001-0782 |
Citations | PageRank | References |
3 | 2.82 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edward M. Reingold | 1 | 2214 | 563.65 |