On the average communication complexity of asynchronous distributed algorithms

Caption title.

Bibliographic Details
Other Authors: Tsitsiklis, John N.
Language:eng
Published: Massachusetts Institute of Technology, Laboratory for Information and Decision Systems 2002
Subjects:
Online Access:http://hdl.handle.net/1721.1/1237
_version_ 1826204175783952384
author2 Tsitsiklis, John N.
author_facet Tsitsiklis, John N.
collection MIT
description Caption title.
first_indexed 2024-09-23T12:50:05Z
id mit-1721.1/1237
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T12:50:05Z
publishDate 2002
publisher Massachusetts Institute of Technology, Laboratory for Information and Decision Systems
record_format dspace
spelling mit-1721.1/12372019-04-12T07:27:54Z On the average communication complexity of asynchronous distributed algorithms Tsitsiklis, John N. Stamoulis, George D. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. TK7855.M41 E3845 no.2338 Caption title. Includes bibliographical references (leaf [19]). 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 John N. Tsitsiklis and George D. Stamoulis. 2002-06-21T03:39:49Z 2002-06-21T03:39:49Z 1996 http://hdl.handle.net/1721.1/1237 eng LIDS-P ; 2338 [19] p. application/pdf application/pdf Massachusetts Institute of Technology, Laboratory for Information and Decision Systems
spellingShingle TK7855.M41 E3845 no.2338
On the average communication complexity of asynchronous distributed algorithms
title On the average communication complexity of asynchronous distributed algorithms
title_full On the average communication complexity of asynchronous distributed algorithms
title_fullStr On the average communication complexity of asynchronous distributed algorithms
title_full_unstemmed On the average communication complexity of asynchronous distributed algorithms
title_short On the average communication complexity of asynchronous distributed algorithms
title_sort on the average communication complexity of asynchronous distributed algorithms
topic TK7855.M41 E3845 no.2338
url http://hdl.handle.net/1721.1/1237