| dc.contributor | Tsitsiklis, John N. | en_US |
| dc.contributor | Stamoulis, George D. | en_US |
| dc.contributor | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. | en_US |
| dc.date.accessioned | 2003-04-29T15:35:22Z | |
| dc.date.available | 2003-04-29T15:35:22Z | |
| dc.date.issued | 1990 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/3209 | |
| dc.description | Cover title. | en_US |
| dc.description | Includes bibliographical references (p. 12). | en_US |
| dc.description.sponsorship | Supported by the National Science Foundation, with matching funds from Bellcore Inc. and the Draper Laboratory. ECS-8552419 Supported by the ARO. DAAL03-86-K-0171 | en_US |
| dc.description.statementofresponsibility | John N. Tsitsiklis and George D. Stamoulis. | en_US |
| dc.format.extent | 12 p. | en_US |
| dc.format.extent | 1529525 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 ; 1986 | en_US |
| dc.subject.lcc | TK7855.M41 E3845 no.1986 | en_US |
| dc.title | On the average communication complexity of asynchronous distributed algorithms | en_US |
