dc.contributor.advisor | Charles E. Leiserson. | en_US |
dc.contributor.author | Goldberg, Andrew Vladislav | en_US |
dc.contributor.other | Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. | en_US |
dc.date.accessioned | 2005-08-08T18:17:05Z | |
dc.date.available | 2005-08-08T18:17:05Z | |
dc.date.copyright | 1987 | en_US |
dc.date.issued | 1987 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/14912 | |
dc.description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987. | en_US |
dc.description | MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. | en_US |
dc.description | Bibliography: p. 117-123. | en_US |
dc.description.statementofresponsibility | by Andrew Vladislav Goldberg. | en_US |
dc.format.extent | [2], 123 leaves | en_US |
dc.format.extent | 10077865 bytes | |
dc.format.extent | 10077621 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 | Efficient graph algorithms for sequential and parallel computers | en_US |
dc.type | Thesis | en_US |
dc.description.degree | Ph.D. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
dc.identifier.oclc | 16412256 | en_US |