Show simple item record

Analysis of parallel asynchronous schemes for the auction shortest path algorithm

dc.contributor.advisorDimitri P. Bersekas.en_US
dc.contributor.authorPolymenakos, Lazarosen_US
dc.date.accessioned2005-09-21T21:03:06Z
dc.date.available2005-09-21T21:03:06Z
dc.date.copyright1991en_US
dc.date.issued1991en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/13285
dc.descriptionThesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.en_US
dc.descriptionIncludes bibliographical references (leaves 114-115).en_US
dc.description.statementofresponsibilityby Lazoros Polymenakos.en_US
dc.format.extent115 leavesen_US
dc.format.extent6559332 bytes
dc.format.extent6559091 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 Scienceen_US
dc.titleAnalysis of parallel asynchronous schemes for the auction shortest path algorithmen_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.oclc25055489en_US


Files in this item

Thumbnail
Name:
25055489-MIT.pdf
Size:
6.255Mb
Format:
PDF
Description:
Full printable version
View/Open

This item appears in the following Collection(s)

Show simple item record