Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3209| Title: | On the average communication complexity of asynchronous distributed algorithms |
| Authors: | Tsitsiklis, John N. Stamoulis, George D. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
| Keywords: | TK7855.M41 E3845 no.1986 |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] |
| Description: | John N. Tsitsiklis and George D. Stamoulis. Cover title. Includes bibliographical references (p. 12). 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 |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/3209 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.