On the average communication complexity of asynchronous distributed algorithms
Citable URI:
http://hdl.handle.net/1721.1/1237
| Title: | On the average communication complexity of asynchronous distributed algorithms |
| Author: | Tsitsiklis, John N.; Stamoulis, George D.; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
| Publisher: | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems |
| Issue Date: | 1996 |
| Description: |
Includes bibliographical references (leaf [19]). Caption title. |
| URI: | http://hdl.handle.net/1721.1/1237 |
| Series/Report no.: | LIDS-P ; 2338 |
| Keywords: | TK7855.M41 E3845 no.2338 |
Files in this item
| Files | Size | Format | View | |
|---|---|---|---|---|
| P-2338-36683084.pdf | 1.361Mb |
View/ |
This item appears in the following Collection(s)
-
LIDS Technical Reports
The Laboratory for Information and Decision Systems Technical Report Series
All Items in DSpace@MIT are protected by original copyright, with all rights reserved, unless otherwise indicated.
|
|
Contact
MIT Libraries
|