Some complexity questions related to distributive computing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1979, Pages 209-213

  Yao, Andrew Chi Chih ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

FOLLOWING PROBLEM; INFORMATION EXCHANGES; QUANTITY OF INTEREST;

BOOLEAN FUNCTIONS;

EID: 85039623622     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/800135.804414     Document Type: Conference Paper

References (3)

1. H. Abelson, Lower Bounds on Information Transfer in Distributed Computations, Proc. IEEE 19-th Annual Symp. On Foundations of Computer Science, Ann Arbor, 1978, pp. 151-158.
2. M. O. Rabin, Probabilistic Algorithms, in Algorithms and Complexity: Recent Results and New Directions, edited by J. F. Traub, Academic Press, 1976, pp. 21-40.
3. M. O. Rabin and A. C. Yao, in preparation.