A nonrecursive list moving algorithm
Edward M. Reingold · Communications of the ACM · 1973
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.
Cited by 7 works. doi:10.1145/362041.362200 Open-access PDF
Authors
References
- The Art of Computer Programming
- Linguistic methods in picture processing
- Computer Interpretation of English Text and Picture Patterns
- Picture Processing and Psychopictorics
- An efficient machine-independent procedure for garbage collection in various list structures
- A nonrecursive list compacting algorithm
- Programmed Grammars and Classes of Formal Languages
- Array Automata and Array Grammars
- The syntax of a triangle and some other figures
- Two-dimensional formal languages and pattern recognition by cellular automata