A general framework for the study of a broad class of communication problems is developed. It is based on a recent analysis of the communication complexity of graph connectivity. The approach makes use of combinatorial lattice theory.
|Title of host publication||Annual Symposium on Foundations of Computer Science (Proceedings)|
|Publisher||Publ by IEEE|
|Number of pages||10|
|Publication status||Published - Dec 1 1988|
|Name||Annual Symposium on Foundations of Computer Science (Proceedings)|
ASJC Scopus subject areas
- Hardware and Architecture