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/3209

Full metadata record

DC Field	Value	Language
dc.contributor	Tsitsiklis, John N.	-
dc.contributor	Stamoulis, George D.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:35:22Z	-
dc.date	2003-04-29T15:35:22Z	-
dc.date	1990	-
dc.date.accessioned	2013-06-04T16:16:22Z	-
dc.date.available	2013-06-04T16:16:22Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/3209	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	John N. Tsitsiklis and George D. Stamoulis.	-
dc.description	Cover title.	-
dc.description	Includes bibliographical references (p. 12).	-
dc.description	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	-
dc.format	12 p.	-
dc.format	1529525 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]	-
dc.relation	LIDS-P ; 1986	-
dc.subject	TK7855.M41 E3845 no.1986	-
dc.title	On the average communication complexity of asynchronous distributed algorithms	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI