| dc.contributor | Awerbuch, Baruch. | en_US |
| dc.contributor | Gallager, Robert G. | en_US |
| dc.date.accessioned | 2003-04-29T15:25:45Z | |
| dc.date.available | 2003-04-29T15:25:45Z | |
| dc.date.issued | 1985 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/2889 | |
| dc.description | Bibliography: p. 21. | en_US |
| dc.description.sponsorship | Supported in part by National Science Foundation Grant NSF-ECS-8310698 and in part by the Defense Advanced Research Projects Agency under Contract ONR/N00014-84-K-0357. | en_US |
| dc.description.statementofresponsibility | Baruch Awerbuch, Robert G. Gallager. | en_US |
| dc.format.extent | 21 p., [13] p. of plates | en_US |
| dc.format.extent | 1875480 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Laboratory for Information and Decision Systems, Massachusetts Institute of Technology | en_US |
| dc.relation.ispartofseries | LIDS-P ; 1473 | en_US |
| dc.subject.lcc | TK7855.M41 E3845 no.1473 | en_US |
| dc.title | Communication complexity of distributed shortest path algorithms | en_US |
