On the average communication complexity of asynchronous distributed algorithms
Citable URI:
http://hdl.handle.net/1721.1/3209
| 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: | Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] |
| Issue Date: | 1990 |
| Description: |
Cover title. Includes bibliographical references (p. 12). |
| URI: | http://hdl.handle.net/1721.1/3209 |
| Series/Report no.: | LIDS-P ; 1986 |
| Keywords: | TK7855.M41 E3845 no.1986 |
Files in this item
| Files | Size | Format | View | |
|---|---|---|---|---|
| P-1986-22195795.pdf | 1.529Mb |
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
|