dc.contributor.advisor | Robert Gallager. | en_US |
dc.contributor.author | Friedman, Daniel Uri | en_US |
dc.contributor.other | Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. | en_US |
dc.date.accessioned | 2005-08-04T16:04:23Z | |
dc.date.available | 2005-08-04T16:04:23Z | |
dc.date.issued | 1979 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/16054 | |
dc.description | Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979. | en_US |
dc.description | MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. | en_US |
dc.description | Includes bibliographical references. | en_US |
dc.description.statementofresponsibility | by Daniel U. Friedman. | en_US |
dc.format.extent | [4], 92 leaves | en_US |
dc.format.extent | 4504939 bytes | |
dc.format.extent | 4504698 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.subject.lcsh | Computational complexity | en_US |
dc.subject.lcsh | Electronic data processing Distributed processing | en_US |
dc.subject.lcsh | Computer networks | en_US |
dc.subject.lcsh | Algorithms | en_US |
dc.title | Communication complexity of distributed shortest path algorithms | 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 | 07404253 | en_US |