On randomized one-round communication complexity

Computational Complexity

Volumn 8, Issue 1, 1999, Pages 21-49

  Kremer, Ilan ^a   Nisan, Noam ^c   Ron, Dana ^b  

^a NORTHWESTERN UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Communication complexity; One round and simultaneous protocols; VC dimension

Indexed keywords

EID: 0033434847     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s000370050018     Document Type: Article

References (25)

1. F. ABLAYEV, Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science 157(2) (1996), 139-159.
2. N. ALON, S. BEN-DAVID, N. CESA-BIANCHI, AND D. HAUSSLER, Scale-sensitive dimensions, uniform convergence, and learnability. Journal of the Association for Computing Machinery 44(4) (1997), 616-631.
3. A. AMBAINIS, Communication complexity in a 3-computer model. Algorithmica 16 (1996), 298-301.
4. L. BABAI AND P. KIMMEL, Randomized simultaneous messages: solution of a problem of Yao in communication complexity. In Proc. 12th IEEE Symp. on Computational Complexity, 1997, 239-246.
5. L. BABAI, P. FRANKL, AND J. SIMON, Complexity classes in communication complexity theory. In Proceedings of the Twenty-Seventh Annual Symposium on Foundations of Computer Science, 1986, 337-347.
6. P. L. BARTLETT, P. M. LONG, AND R. C. WILLIAMSON, Fat-shattering and the learnability of real-valued functions. Journal of Computer and System Sciences 52(3) (1996), 434-452.
7. A. BLUMER, A. EHRENFEUCHT, D. HAUSSLER, AND M. K. WARMUTH, Learnability and the Vapnik-Chervonenkis dimension. Journal of the Association for Computing Machinery 36(4) (1989), 929-965.
8. J. BOURGAIN AND A. WIGDERSON. Private Communications, 1996.
9. M. X. GOEMANS AND D. P. WILLIAMSON, .878-approximation algorithms for max cut and max 2sat. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, 1994, 422-431.
10. D. HAUSSLER, Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation 100(1) (1992), 78-150.
11. B. KALYANASUNDARAM AND G. SCHNITGER, The probabilistic communication complexity of set intersection. SIAM Journal on Computing 13(4) (1992), 547-557.
12. M. J. KEARNS AND R. E. SCHAPIRE, Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences 48(3) (1994), 464-497.
13. E. KUSHILEVITZ AND N. NISAN, Communication Complexity. Cambridge University Press, 1996.
14. R. J. LIPTON AND R. SEDGEWICK, Lower bounds for VLSI. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, 1981, 300-307.
15. P. B. MILTERSEN, N. NISAN, S. SAFRA, AND A. WIGDERSON, On data structures and asymmetric communication complexity. Journal of Computer and System Sciences 57(1) (1998), 37-49.
16. M. NAOR, Private communication. 1994.
17. I. NEWMAN, Private vs. common random bits in communication complexity. Information processing letters 39 (1991), 67-71.
18. I. NEWMAN, Private communication. 1994.
19. I. NEWMAN AND M. SZEGEDY, Public vs. private coin flips in one round communication games. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996, 561-570.
20. C. PAPADIMITRIOU AND M. SIPSER, Communication complexity. Journal of Computer and System Sciences 28(1) (1984), 106-123.
21. D. POLLARD, Convergence of Stochastic Processes. Springer-Verlag, 1984.
22. A. RAZBOROV, On the distributional complexity of disjointness. Theoretical Computer Science 106(2) (1992), 385-390.
23. V. N. VAPNIK AND A. Y. CHERVONENKIS, On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its applications 17(2) (1971), 264-280.
24. A. YAO, Some complexity questions related to distributive computing. In Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, 1979, 209-213.
25. A. YAO, Lower bounds by probabilistic arguments. In Proceedings of the Twenty-Fourth Annual Symposium on Foundations of Computer Science, 1983, 420-428.