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 synchronization, clock synchronization, controlling protocols' worst-case execution, connected components, spanning tree, etc., constructing a minimum spanning tree, constructing a shortest path tree.
| Original language | English |
|---|---|
| Pages | 177-187 |
| Number of pages | 11 |
| DOIs | |
| State | Published - 1990 |
| Externally published | Yes |
| Event | Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing - Quebec City, Que, Can Duration: 22 Aug 1990 → 24 Aug 1990 |
Conference
| Conference | Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing |
|---|---|
| City | Quebec City, Que, Can |
| Period | 22/08/90 → 24/08/90 |