We are experiencing some difficulties with our submission forms, which we are working to resolve. If you have any issues, please contact us at dspace-lib@mit.edu.

Storage and Access Costs for Implementations of Variable - Length lists

Thumbnail Image
Download
Name

MIT-LCS-TR-217.pdf

Size

5.68 MB

Format

Adobe PDF

Checksum (MD5)

e2230602121f029a6ceab270d9233168

Author(s)
Brown, Donna Jean
Advisor(s)
Elias, Peter
Date Issued
April 1979
Series/Report no.
MIT-LCS-TR-217
Abstract
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.