dc.contributor | Tsitsiklis, John N. | |
dc.contributor | Stamoulis, George D. | |
dc.contributor | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. | |
dc.date.accessioned | 2002-06-21T03:39:49Z | |
dc.date.available | 2002-06-21T03:39:49Z | |
dc.date.issued | 1996 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/1237 | |
dc.description | Caption title. | en |
dc.description | Includes bibliographical references (leaf [19]). | en |
dc.description.sponsorship | Supported by the National Science Foundation (NSF). ECS 85-52419 Matching funds from Bellcore, Inc, and the Draper Laboratory and by the ARO. DAAL03-86-K-0171, DAAL03-92-G-0115 | en |
dc.description.statementofresponsibility | John N. Tsitsiklis and George D. Stamoulis. | |
dc.format.extent | [19] p. | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | |
dc.publisher | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems | |
dc.relation.ispartofseries | LIDS-P ; 2338 | |
dc.subject.lcc | TK7855.M41 E3845 no.2338 | |
dc.title | On the average communication complexity of asynchronous distributed algorithms | en |