Randomized communication protocols (a survey)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2264, Issue , 2001, Pages 1-32

  HromkoviČ, Juraj ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Communication complexity; Randomized computing; Twoparty protocols

Indexed keywords

STOCHASTIC SYSTEMS; SURVEYS;

COMMUNICATION COMPLEXITY; COMPLEXITY MEASURES; COMPLEXITY THEORY; COMPUTING MODEL; MODELS OF COMPUTATION; RANDOMIZED COMPUTING; TWO-PARTY PROTOCOLS;

COMPUTATIONAL COMPLEXITY;

EID: 46949091671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45322-9_1     Document Type: Conference Paper

References (34)

1. Yao, A.C.: Some complexity questions related to distributive computing. Proc. 11th ACM STOC, ACM 1979, pp. 209–213.
2. Abelson, H.: Lower bounds on information transfer in distributed computations. Proc. 19th IEEE FOCS, IEEE 1978, pp. 151–158.
3. Hromkovič, J.: Communication Complexity and Parallel Computing. Springer- Verlag 1997.
4. Kushilevitz, E., Nisan, N.: Communication Complexity, Cambridge University Press 1997.
5. Thompson, C.D.: Area-time complexity for VLSI. Proc. 11th ACM STOC, ACM 1979, pp. 81–88.
6. Thompson, C.D.: A complexity theory for VLSI. Doctoral dissertation. CMU-CS- 80-140, Computer Science Department, Carnagie-Mellon University, Pittsburgh, August 1980, 131 p.
7. Savage, J.E.: Area-time tradeoffs for matrix multiplication and related problems in VLSI models. J. ofComputer and System Sciences 20(1981), pp. 230–242.
8. Leiserson, C.E.: Area efficient graph algorithms (for VLSI). Proc. 21st IEEE FOCS, IEEE 1980, pp. 270–281.
9. Lovász, L.: Communication Complexity: A Survey. Techn. Report CS-TR-204-89, Princeton University, 1989 (also in: Paths, Flows and VLSI Layout (Korte, Lovász, Promel, and Schrijver, eds.) Springer-Verlag 1990, pp. 235–266).
10. Hromkovič, J.: Some complexity aspects of VLSI computations. Part 1. A framework for the study of information transfer in VLSI circuits. Computers and Artificial Intelligence 7 (1988), pp. 229–252.
11. Čurič, P., Galil, Z.: On the power of multiple reads in chip. Information and Computation 104 (1993), pp. 277–287.
12. Karchmer, M., Wigderson, A.: Monotone circuits for connectivity require superlogarithmic depth. Proc. 20th ACM STOC, ACM 1988, pp. 539–550. (also SIAM J. Discrete Mathematics 3 (1990), 718–727).
13. Alon, N., Maas, W.: Meanders, Ramsey theory and lower bounds for branching programs. Proc. 27th IEEE FOCS, IEEE 1986, pp. 410–417.
14. Ajtai, M.: A non-linear time lower bound for Boolean branching programs. Proc. 40th IEEE FOCS, IEEE 1999, pp. 60–70.
15. Beame, P.W., Saks, M., Thathachar, J.S.: Time-space tradeoffs for branching programs. Proc. 39th IEEE FOCS, IEEE 1998, pp. 254–263.
16. Hromkoviˇc, J.: Nonlinear lower bounds on the number of processors of circuits with sublinear separators. Information and Computation 95 (1991), pp. 117–128.
17. Turán, G.: Lower bounds for synchronous circuits and planar circuits. Information Processing Letters 130(1989), pp. 37–40.
18. Newman, I.: Private versus common random bits in communication complexity. Information Processing Letters 39 (1991), pp. 67–71.
19. Freivalds, R.: Probabilistic machines can use less running time. Information Processing 1977, IFIP, North Holland 1977, pp. 839–842.
20. Aho, A.V., Ullman, J.D., Yannakakis, M.: On notions of informations transfer in VLSI circuits. Proc. 15th ACM STOC, ACM 1983, pp. 133–139.
21. Mehlhorn, K., Schmidt, E.: Las Vegas is better than determinism in VLSI and distributed computing. Proc. 14th Annual ACM Symposium on Theory ofComputing, San Francisco, ACM 1982, pp. 330–337.
22. Hromkovič, J., Schnitger, G.: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata. Information and Computation 169 (2001), pp. 284–296.
23. Ja’Ja, J., Prassanna Kamar, V.K., Simon, J.: Information transfer under different sets of protocols. SIAM J. Computing 13 (1984), pp. 840–849.
24. Papadimitriou, Ch., Sipser, M.:communication complexity. Proc. 14th ACM STOC 1982, pp. 196–200.
25. Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory. Proc. 27th IEEE FOCS, IEEE 1986, pp. 337–347.
26. Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. Proc. 2nd Annual Conference on Structure in Complexity Theory, 1987, pp. 41–47.
27. Razborov, A.A.: On the distributed complexity of disjointness. Proc. 17th ICALP, Springer-Verlag 1990, pp. 249–253. (also Theoretical Computer Science 106 (1992), 385–390.)
28. Ablayev, F.M.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science 157 (1996), pp. 139–159.
29. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. Proc. 26th IEEE FOCS, IEEE 1985, pp. 429– 442.
30. Halstenberg, B., Reischuk, R.: On different modes of communication. Proc. 20th ACM STOC, ACM 1988, pp. 162–172.
31. King, F.P., Abhasel, G.: Communication complexity of computing the Hamming distance. SIAM J. Computing 15 (1986), pp. 932–946.
32. Meinel, Ch., Waack, S.: Lower bounds for the majority communication complexity of various graph accessibility problems. Proc. 20th MFCS’95, Lecture Notes in Computer Science 969, Springer-Verlag. 1995, pp.299–308.
33. Nisan, N., Wigderson, A.: Bounds in communication complexity revised. 32nd ACM STOC, ACM 1991, pp. 419–429 (also in SIAM J. Computing 22 (1993), pp. 211–219).
34. Yao, A.C.: Lower bounds by probabilistic arguments. Proc. 25th ACM STOC, ACM 1983, pp. 420–428.