Show simple item record

On the average communication complexity of asynchronous distributed algorithms

dc.contributorTsitsiklis, John N.
dc.contributorStamoulis, George D.
dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.
dc.date.accessioned2002-06-21T03:39:49Z
dc.date.available2002-06-21T03:39:49Z
dc.date.issued1996
dc.identifier.urihttp://hdl.handle.net/1721.1/1237
dc.descriptionCaption title.en
dc.descriptionIncludes bibliographical references (leaf [19]).en
dc.description.sponsorshipSupported 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-0115en
dc.description.statementofresponsibilityJohn N. Tsitsiklis and George D. Stamoulis.
dc.format.extent[19] p.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systems
dc.relation.ispartofseriesLIDS-P ; 2338
dc.subject.lccTK7855.M41 E3845 no.2338
dc.titleOn the average communication complexity of asynchronous distributed algorithmsen


Files in this item

Thumbnail
Name:
P-2338-36683084.pdf
Size:
1.298Mb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record