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

Full metadata record

DC Field	Value	Language
dc.contributor	Stamoulis, George D.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.contributor	Tsitsiklis, John N.	-
dc.date	2002-06-21T03:39:49Z	-
dc.date	2002-06-21T03:39:49Z	-
dc.date	1996	-
dc.date.accessioned	2013-05-31T16:27:06Z	-
dc.date.available	2013-05-31T16:27:06Z	-
dc.date.issued	2013-06-01	-
dc.identifier	http://hdl.handle.net/1721.1/1237	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	John N. Tsitsiklis and George D. Stamoulis.	-
dc.description	Includes bibliographical references (leaf [19]).	-
dc.description	Caption title.	-
dc.description	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	-
dc.format	[19] p.	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems	-
dc.relation	LIDS-P ; 2338	-
dc.subject	TK7855.M41 E3845 no.2338	-
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