Return to search

On the average communication complexity of asynchronous distributed algorithms

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

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/1237
Date January 1996
ContributorsTsitsiklis, John N., Stamoulis, George D., Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
PublisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systems
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
Format[19] p., application/pdf
RelationLIDS-P ; 2338

Page generated in 0.0018 seconds