| dc.contributor |
Awerbuch, Baruch. |
|
| dc.contributor |
Gallager, Robert G. |
|
| dc.date |
2003-04-29T15:25:45Z |
|
| dc.date |
2003-04-29T15:25:45Z |
|
| dc.date |
1985 |
|
| dc.date.accessioned |
2013-06-04T16:15:40Z |
|
| dc.date.available |
2013-06-04T16:15:40Z |
|
| dc.date.issued |
2013-06-05 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/2889 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
Baruch Awerbuch, Robert G. Gallager. |
|
| dc.description |
Bibliography: p. 21. |
|
| dc.description |
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. |
|
| dc.format |
21 p., [13] p. of plates |
|
| dc.format |
1875480 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
eng |
|
| dc.publisher |
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology |
|
| dc.relation |
LIDS-P ; 1473 |
|
| dc.subject |
TK7855.M41 E3845 no.1473 |
|
| dc.title |
Communication complexity of distributed shortest path algorithms |
|