Communication Complexity

Advances in Computers

Volumn 44, Issue C, 1997, Pages 331-360

  Kushilevitz, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956759869     PISSN: 00652458     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0065-2458(08)60342-3     Document Type: Chapter

References (56)

1. Aho, A., Ullman, J. and Yannakakis, M. (1983) On notions of information transfer in VLSI circuits. In Proc. of 15th STOC, pp. 133-139.
2. Alon N., and Maass W. Meanders and their applications in lower bound arguments. JCSS 37 2 (1988) 118-129 (Early version (1986), In Proc. of 27th FOCS, pp. 410-417.)
3. Alon N., and Seymour P.D. A counterexample to the rank-coloring conjecture. J. of Graph Theory 13 (1989) 523-525
4. Babai L., Pudlák P., Rödl V., and Szemeredi E. Lower bounds to the complexity of symmetric Boolean functions. Theoretical Computer Science 74 (1990) 313-323
5. Babai L., Nisan N., and Szegedy M. Multiparty protocols, pseudorandom generators for LOGSPACE, and time-space trade-off. JCSS 45 2 (1992) 204-232 (Early version (1989). In Proc. of 21st STOC, pp. 1-11.)
6. Babai, L., Kimmel, P., and Lokam, S.V. (1995) Simultaneous messages vs. communication. In Proc. of 12th STACS, LNCS 900, pp. 361-372.
7. Bryant R.E. Graph-based Algorithms for Boolean function manipulations. IEEE Transactions on Computers 35 (1986) 677-691
8. Bryant R.E. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24 2 (1992) 293-318
9. Chandra, A.K., Furst, M.L., and Lipton, R.J. (1983) Multiparty protocols. In Proc. of 15th STOC, pp. 94-99.
10. Chor B., and Goldreich O. Unbiased bits from sources of weak randomness and probabilistic communication complexit. SIAM J. Computing 17 2 (1988) 230-261 (Early version (1985), In Proc. of 26th FOCS, pp. 429-442.)
11. Cobham, A. (1966) The recognition problem for the set of perfect squares. Technical report RC-1704, IBM.
12. Dietzfelbinger, M., Hromkovic, J. and Schnitger, G. (1994) A comparison of two lower bound methods for communication complexity. In Proc. of MFCS94, LNCS 841, pp. 326-335.
13. Ďuriš P., Galil Z., and Schnitger G. Lower bounds on communication complexity. Information and Computation 73 1 (1987) 1-22 (Early version (1984), In Proc. of 16th STOC, pp. 81-91.)
14. Edmonds, J. Rudich, S., Impagliazzo, R., and Sgall, J. (1991) Communication complexity towards lower bounds on circuit depth. In Proc. of 32nd FOCS, pp. 249-257.
15. Feder T., Kushilevitz E., Naor M., and Nisan N. Amortized communication complexity. SIAM J. Computing 24 4 (1995) 736-750 (Early version (1991), In Proc. of the 32nd FOCS, pp. 239-248.)
16. Fürer, M. (1987) The power of randomness for communication complexity, In Proc. of the 19th STOC, pp. 178-181.
17. Goldmann M. Communication complexity and lower bounds for threshold circuits. Chapter 3. In: Roychowdhury V., Siu K.Y., and Orlitsky A. (Eds). "Theoretical Advances in Neural Computation and Learning" (1994), Kluwer Academic Publishers 85-125
18. Gringi M., and Sipser M. Monotone separation of logarithmic space from logarithmic depth. JCSS 50 (1995) 433-437 (Early version (1991), In Proc. of 6th Structure in Complexity Theory, pp. 294-298.)
19. Groger, H.D., and Turan, G. (1991) On linear decision trees computing Boolean functions. In Proc of 18th ICALP, LNCS 510, pp. 707-718.
20. Grolmusz V. The BNS lower bound for multiparty protocols is nearly optimal. Information and Computation 112 1 (1994) 51-54
21. Halstenberg B., and Reischuk R. Different modes of communication. SIAM J. Computing 22 5 (1993) 913-934 (Early version (1988), In Proc. of 20th STOC, pp. 162-172.)
22. Håstad, J. and Goldman, M. (1990) On the power of small-depth threshold circuits. In Proc. of 31st FOCS, pp. 610-618.
23. Hopcroft J.E., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (1979), Addison-Wesley
24. Kalyanasundaram B., and Schnitger G. The probabilistic communication complexity of set intersection. SIAM J. Discrete Math 5 4 (1992) 545-557 (Early version (1987), In Proc. of 2nd Structure in Complexity Theory, pp. 41-49.)
25. Karchmer M. "Communication Complexity: A New Approach to Circuit Depth," (1989), The MIT Press
26. Karchmer M., and Wigderson A. Monotone circuits for connectivity require superlogarithmic depth. SIAM J. Discrete Math 3 2 (1990) 255-265 (Early version (1988), In Proc. of 20th STOC, pp. 539-550.)
27. Karchmer, M., Raz, R., and Wigderson, A. (1991) On proving super-logarithmic depth lower bounds via the direct sum in communication complexity. In Proc. of 6th IEEE Structure in Complexity Theory, pp. 299-304.
28. Karchmer M., Kushilevitz E., and Nisan N. Fractional covers and communication complexity. SIAM J. Discrete Math 8 1 (1995) 76-92 (Early version (1992), In 7th IEEE Structure in Complexity Theory, pp. 262-274.)
29. Kushilevitz E., and Nisan N. "Communication Complexity." (1996), Cambridge University Press, Cambridge
30. Kushilevitz, E., Linial, N., and Ostrovsky, R. (1996) The linear-array conjecture of communication complexity is false. In Proc. of 28th STOC.
31. Leighton, F.T. (1991) "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes." Morgan-Kaufmann.
32. Lengauer, T. (1990) VLSI Theory. In "Handbook of Theoretical Computer Science," Vol. A, Chapter 16, pp. 835-868.
33. Lipton, R.J. and Sedgewick, R. (1981) Lower bounds for VLSI. In Proc. of 13th STOC, pp. 300-307.
34. Lipton R.J., and Tarjan R.E. Applications of a planar separator theorem. SIAM J. Computing 9 (1980) 615-627
35. Lovász L. Communication complexity: A Survey. In: Korte B.H. (Ed). "Paths, Flows, and VLSI Layout" (1990), Springer Verlag, Berlin
36. Mehlhorn, K., and Schmidt, E. (1982) Las-Vegas is better than determinism in VLSI and distributed computing. In Proc. of 14th STOC, pp. 330-337.
37. Miltersen, P.B. (1994) Lower bounds for union-split-find related problems on random access machines, In Proc. of 26th STOC, pp. 625-634.
38. Miltersen, P.B., Nisan, N., Safra, S., and Wigderson, A. (1995) On data structures and asymmetric communication complexity, In Proc of 27th STOC, pp. 103-111.
39. Muroga S. "Threshold Logic and Its Applications." (1971), Wiley Interscience
40. Newman I. Private vs. common random bits in communication complexity. Information Processing Letters 39 (1991) 67-71
41. Nisan N. The communication complexity of threshold gates. In: Miklós S., and Szönyi (Eds). Combinatorics: Paul Erdös is Eighty," 1 (1993), Bolyai Math. Society 301-315
42. Nisan N., and Wigderson A. Rounds in communication complexity revisited. SIAM J. Computing 22 1 (1993) 211-219 (Early version, (1991) In Proc. of 23rd STOC, pp. 419-429.)
43. Nisan N., and Wigderson A. On rank vs. communication complexity. Combinatorica 15 4 (1995) 557-566 (Early version (1994), In Proc. of 35th FOCS, pp. 831-836.)
44. Orlitsky A., and El-Gamal A. Communication complexity. In: Abu-Mostafa Y.S. (Ed). "Complexity in Information Theory" (1988), Springer, New York 16-61
45. Papadimitriou C., and Sipser M. Communication complexity. JCSS 28 2 (1984) 260-269 (Early version (1982). In Proc. of 14th STOC, pp. 196-200.)
46. Pudlák P., and Rödl, V. (1993) Modified ranks of tensors and the size of circuits. In Proc of 25th STOC, pp. 523-531.
47. Raz R., and Spieker B. On the "log rank" conjecture in communication complexity. Combinatorica 15 4 (1995) 567-588 (Early version, (1993) In Proc. of 34th FOCS, pp. 168-176.)
48. Raz R., and Wigderson A. Monotone circuits for matching require linear depth. JACM 39 3 (1992) 736-744 (Early version (1990) in Proc. of 22nd STOC, pp. 287-292.)
49. Razborov A.A. Applications of matrix methods to the theory of lower bounds in computational complexity. Combinatorica 10 1 (1990) 81-93
50. Razborov A.A. On the distributional complexity of disjointness. Theoretical Computer Science 106 2 (1992) 385-390 (Early version (1990), In Proc. of 17th ICALP, LNCS 443, pp. 249-253.)
51. Razborov A.A. The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear. Discrete Math 108 (1992) 393-396
52. Roychowdhury V.P., Orlitsky A., and Siu K.Y. Lower bounds on threshold and related circuits via communication complexity. IEEE Transactions on Information Theory. 40 2 (1994) 467-474
53. Shannon C.E. A mathematical theory of communication. Bell System Techn. Jour. 27 (1948) 379-423 623-656
54. Siu K.Y., Roychowdhury V., and Kailath T. "Discrete Neural Computation-A Theoretical Foundation." (1995), Prentice Hall
55. Thompson, C.D. (1979) Area-time complexity for VLSI. In Proc. of 11th STOC, pp. 81-88.
56. Yao, A.C. (1979) Some complexity questions related to distributed computing. In Proc. of 11th STOC, pp. 209-213.