STORAGE AND ACCESS COSTS FOR IMPLEMENTATIONS OF VARIABLE LENGTH LISTS
D. Brown · DSpace@MIT (Massachusetts Institute of Technology) · 1979
Consider a machine with a cellular memory used to store a list X , where X is a finite alphabet and i N. We investigate the machine representation of such a list and the implementation of common list operations such as determining the i th element and adding or deleting an element.