Some Contributions of the Study of Abstract Communication Complexity to Other Areas of Computer Science Juraj Hromkovi c Department of Computer Science I (Algorithms and Complexity), RWTH Aachen, 52056 Aachen, Germany The aim of this survey is to present some contribution of the study of two-party communication protocols to other areas of computer science. Here, we concentrate on the applications of communication complexity for the study of several fundamental computing models, for the comparison of the power of deterministic, and probabilistic computations, and for the development of some kind of secure communication protocols in the practice 1. INTRODUCTION The communication complexity of two-party protocols has been introduced by Abelson [1] and Yao [13] in 1978-1979. The initial goal was to develop a method for proving lower bounds on the complexity of distributed and parallel computations, with a special emphasis on VLSI computations. Informally, a two-party (communication) protocol consists of two computers CI and CII computing a function1 f : X Y â Z in the following way. At the beginning CI obtains an input x X and CII obtains an input y Y . Then CI and CII communicate according to the protocol by exchanging binary
/lp/association-for-computing-machinery/some-contributions-of-the-study-of-abstract-communication-complexity-QqsetaKS8Q