Bounds on tradeoffs between randomness and communication complexity-Reference-Cited by-同舟云学术

Bounds on tradeoffs between randomness and communication complexity

Published:1993-06 Issue:2 Volume:3 Page:141-167
ISSN:1016-3328
Container-title:Computational Complexity
language:en
Short-container-title:Comput Complexity

Author:

Canetti Ran,Goldreich Oded

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01200118.pdf

Reference33 articles.

1. R. Aleliunas, Randomized parallel communication, inProc. of 1st PODC (1982), 60?72.

2. N. Alon, P. Frankl and V. Rödl, Geometrical realization of set systems and probabilistic communication complexity,Proc. of 26th FOCS (1982), 277?280.

3. E. Bach andV. Shoup, Factoring polynomials using fewer random Bits,Journal of Symbolic Computation no. 9 (1990), 229?239.

4. M. Bellare, O. Goldreich and S. Goldwasser, Randomness in interactive proofs,Proc. of 31st FOCS (1990), 563?571.

5. A. Borodin andJ. E. Hopcroft, Routing, merging, and sorting on parallel models of computing,Journal of Computer and System Science no. 30 (1985), 130?145.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Amortized Communication Complexity of an Equality Predicate;Computer Science – Theory and Applications;2013

2. Computing (and Life) Is All about Tradeoffs;Lecture Notes in Computer Science;2013

3. Our Adversary: The Circuit;Algorithms and Combinatorics;2011-11-28

4. Communication vs. Computation;computational complexity;2007-05

5. On multi-partition communication complexity;Information and Computation;2004-10