Show simple item record

dc.contributor.advisorElias, Peteren_US
dc.contributor.authorBrown, Donna Jeanen_US
dc.date.accessioned2023-03-29T15:03:05Z
dc.date.available2023-03-29T15:03:05Z
dc.date.issued1979-04
dc.identifier.urihttps://hdl.handle.net/1721.1/149503
dc.description.abstractConsider 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.en_US
dc.relation.ispartofseriesMIT-LCS-TR-217
dc.titleStorage and Access Costs for Implementations of Variable - Length listsen_US
dc.identifier.oclc05331928


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record