Cost-sensitive Analysis of Communication Protocols
| dc.contributor.author | Awerbuch, Baruch | en_US |
| dc.contributor.author | Baratz, Alan | en_US |
| dc.contributor.author | Peleg, David | en_US |
| dc.date.accessioned | 2023-03-29T14:35:12Z | |
| dc.date.available | 2023-03-29T14:35:12Z | |
| dc.date.issued | 1991-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149180 | |
| dc.description.abstract | This paper introduces the notion of cost-sensitive communication complexity and exemplifies it on the following basic communication problems: computing a global function, network synchornization, clock synchronization, controlling protocols' worst-case execution, connected components, spanning tree, etc., contructing a minimymn spanning tree, constructing a shortest path tree. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-453 | |
| dc.title | Cost-sensitive Analysis of Communication Protocols | en_US |
| dc.identifier.oclc | 26707648 |
