On the average communication complexity of asynchronous distributed algorithms

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/1237

Title:	On the average communication complexity of asynchronous distributed algorithms
Authors:	Stamoulis, George D. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. Tsitsiklis, John N.
Keywords:	TK7855.M41 E3845 no.2338
Issue Date:	1-Jun-2013
Publisher:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems
Description:	John N. Tsitsiklis and George D. Stamoulis. Includes bibliographical references (leaf [19]). Caption title. 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
URI:	http://koha.mediu.edu.my:8181/jspui/handle/1721
Other Identifiers:	http://hdl.handle.net/1721.1/1237
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI