Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.Includes bibliographical references (leaves 153-158).by Zhi-Quan Luo.Sc.D
Caption title.Includes bibliographical references (leaf [19]).Supported by the National Science Foun...
Title: Communication Complexity Author: Vojtěch Wagner Department: Department of Algebra Supervisor:...
The aim of this survey is to present some contribution of the study of two-party communication proto...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
The area of communication complexity deals with the following type of distributed problem. There are...
Communication complexity studies the amount of communication necessary to compute a function whose v...
Communication complexity studies the amount of communication necessary to compute a function whose v...
In this paper we propose a new approach to the study of the communication requirements of distribute...
Research supported by the ONR under contract N00014-84-K-0519 (NR 649-003) and the ARO unde
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Bibliography: p. 21.Supported in part by National Science Foundation Grant NSF-ECS-8310698 and in pa...
Cover title.Includes bibliographical references.Supported by the ONR. N00014-84-K-0519 (NR 649-003) ...
In this paper we propose a new approach to the study of the communication requirements of distribute...
We consider a number of fundamental statistical and graph problems in the message-passing model, whe...
The complexity of two problems of distributed computation and decision-making is studied. It is show...
Caption title.Includes bibliographical references (leaf [19]).Supported by the National Science Foun...
Title: Communication Complexity Author: Vojtěch Wagner Department: Department of Algebra Supervisor:...
The aim of this survey is to present some contribution of the study of two-party communication proto...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
The area of communication complexity deals with the following type of distributed problem. There are...
Communication complexity studies the amount of communication necessary to compute a function whose v...
Communication complexity studies the amount of communication necessary to compute a function whose v...
In this paper we propose a new approach to the study of the communication requirements of distribute...
Research supported by the ONR under contract N00014-84-K-0519 (NR 649-003) and the ARO unde
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Bibliography: p. 21.Supported in part by National Science Foundation Grant NSF-ECS-8310698 and in pa...
Cover title.Includes bibliographical references.Supported by the ONR. N00014-84-K-0519 (NR 649-003) ...
In this paper we propose a new approach to the study of the communication requirements of distribute...
We consider a number of fundamental statistical and graph problems in the message-passing model, whe...
The complexity of two problems of distributed computation and decision-making is studied. It is show...
Caption title.Includes bibliographical references (leaf [19]).Supported by the National Science Foun...
Title: Communication Complexity Author: Vojtěch Wagner Department: Department of Algebra Supervisor:...
The aim of this survey is to present some contribution of the study of two-party communication proto...