| dc.contributor.advisor | F.T. Leighton and David Karger. | en_US |
| dc.contributor.author | Lewin, Daniel Mark. | en_US |
| dc.date.accessioned | 2005-08-19T14:27:13Z | |
| dc.date.available | 2005-08-19T14:27:13Z | |
| dc.date.copyright | 1998 | en_US |
| dc.date.issued | 1998 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/9947 | |
| dc.description | Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998. | en_US |
| dc.description | Includes bibliographical references (p. 106-108). | en_US |
| dc.description.statementofresponsibility | by Daniel M. Lewin. | en_US |
| dc.format.extent | 110 p. | en_US |
| dc.format.extent | 9178048 bytes | |
| dc.format.extent | 9177804 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Massachusetts Institute of Technology | en_US |
| dc.rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. | en_US |
| dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
| dc.subject | Electrical Engineering and Computer Science | en_US |
| dc.title | Consistent hashing and random trees : algorithms for caching in distributed networks | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | M.S. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.identifier.oclc | 40295142 | en_US |
