Communication complexity of distributed shortest path algorithms
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979.
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Thesis |
| 语言: | eng |
| 出版: |
Massachusetts Institute of Technology
2005
|
| 主题: | |
| 在线阅读: | http://hdl.handle.net/1721.1/16054 |
| _version_ | 1826200840412594176 |
|---|---|
| author | Friedman, Daniel Uri |
| author2 | Robert Gallager. |
| author_facet | Robert Gallager. Friedman, Daniel Uri |
| author_sort | Friedman, Daniel Uri |
| collection | MIT |
| description | Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979. |
| first_indexed | 2024-09-23T11:42:33Z |
| format | Thesis |
| id | mit-1721.1/16054 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T11:42:33Z |
| publishDate | 2005 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/160542019-04-12T15:56:21Z Communication complexity of distributed shortest path algorithms Friedman, Daniel Uri Robert Gallager. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Computational complexity Electronic data processing Distributed processing Computer networks Algorithms Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979. MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. Includes bibliographical references. by Daniel U. Friedman. M.S. 2005-08-04T16:04:23Z 2005-08-04T16:04:23Z 1979 Thesis http://hdl.handle.net/1721.1/16054 07404253 eng 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. http://dspace.mit.edu/handle/1721.1/7582 [4], 92 leaves 4504939 bytes 4504698 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Computational complexity Electronic data processing Distributed processing Computer networks Algorithms Friedman, Daniel Uri Communication complexity of distributed shortest path algorithms |
| title | Communication complexity of distributed shortest path algorithms |
| title_full | Communication complexity of distributed shortest path algorithms |
| title_fullStr | Communication complexity of distributed shortest path algorithms |
| title_full_unstemmed | Communication complexity of distributed shortest path algorithms |
| title_short | Communication complexity of distributed shortest path algorithms |
| title_sort | communication complexity of distributed shortest path algorithms |
| topic | Electrical Engineering and Computer Science. Computational complexity Electronic data processing Distributed processing Computer networks Algorithms |
| url | http://hdl.handle.net/1721.1/16054 |
| work_keys_str_mv | AT friedmandanieluri communicationcomplexityofdistributedshortestpathalgorithms |