Show simple item record

dc.contributor.advisorRobert Gallager.en_US
dc.contributor.authorFriedman, Daniel Urien_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2005-08-04T16:04:23Z
dc.date.available2005-08-04T16:04:23Z
dc.date.issued1979en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/16054
dc.descriptionThesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979.en_US
dc.descriptionMICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING.en_US
dc.descriptionIncludes bibliographical references.en_US
dc.description.statementofresponsibilityby Daniel U. Friedman.en_US
dc.format.extent[4], 92 leavesen_US
dc.format.extent4504939 bytes
dc.format.extent4504698 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectElectrical Engineering and Computer Science.en_US
dc.subject.lcshComputational complexityen_US
dc.subject.lcshElectronic data processing Distributed processingen_US
dc.subject.lcshComputer networksen_US
dc.subject.lcshAlgorithmsen_US
dc.titleCommunication complexity of distributed shortest path algorithmsen_US
dc.typeThesisen_US
dc.description.degreeM.S.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc07404253en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record