Communication Complexity and Sequential Computation

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

Volumn 1295, Issue , 1997, Pages 71-84

  Hromkovič, Juraj ^a   Schnitger, Georg ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b GOETHE UNIVERSITY   (Germany)

Author keywords

Automata; Communication complexity; Computational and structural complexity; Determinism; Las Vegas

Indexed keywords

TURING MACHINES;

AUTOMATA; COMMUNICATION COMPLEXITY; COMPUTATIONAL AND STRUCTURAL COMPLEXITY; DETERMINISM; LAS VEGAS;

COMPUTATIONAL COMPLEXITY;

EID: 84947795337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029950     Document Type: Conference Paper

References (44)

1. Abelson, H,, Lower bounds on information transfer in distributed computations. Proc. 19th Annual Symp. on Foundations of Computer Science, 151-158, 1978.
2. Aho, A.V., Ullman, J.D., Yannakakis, M., On notions of informations transfer in VLSI circuits. Proc. 15th Annual ACM Symp, on Theory of Computing, 133-139, 1983.
3. Babai, L., Nisan, N., Szegedy, M., Multiparty protocols and logspace-hard pseudorandom sequences. Proc. 21st Annual ACM Symp. on Theory of Computing, 1-11, 1989.
4. Beame, P., A general sequential time-space trade-off for finding unique elements. Proc. Slsi Annual ACM Symp. on Theory of Computing, 197-203, 1989.
5. Cobham, A., The intrinsic computational difficulty of functions. Proc. 1964 Congress for Logic, Mathematics and Philosophy of Science, North Holland, 24-30, 1964.
6. Dietzfelbinger, M., The linear-array problem in communication complexity resolved. To appear in Proc. 29th Annual ACM Symp. on Theory of Computing, 1997.
7. Dietzfelbinger, M., Hromkovič, J., Schnitger, G., A comparison of two lower bounds methods for communication complexity. Theo. Comp. Sci. 168 (1), 39-51,1996.
8. Dietzfelbinger, M., Maass, W., Schnitger, G., The complexity of matrix transposition on one-tape Turing machines. Theoretical Computer Science, 82(1), 113-129, 1991
9. Ďuriš P., Hromkovič, J., Rolim, J., Schnitger, G., Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations. Proc. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1200, Springer-Verlag,117-128, 1997.
10. Gurevich, Y., On Kolmogorov machines and related issues. Bulletin of the European Association for Theoretical Computer Science, 1988.
11. Gröger, H.D., Turan, G., On linear decision trees computing Boolean Functions. Proc. 18th International Colloquium on Automata, Languages and Programming, 707-718, 1991.
12. Gröger, H.D., Turan, G., A linear lower bound for the size of threshold circuits. Bulletin of the European Association for Theoretical Computer Science. 1993.
13. Hopkroft, J.E., Ullman, J.D., Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
14. Hromkovic, J., Relation between Chomsky hierarchy and communication complexity hierarchy. Acta Math. Univ. Com. (48-49), 311-317, 1986.
15. Hromkovic, J.: Communication Complexity and Parallel Computing. Springer- Verlag 1997.
16. Kalyanasundaram, B., Schnitger G, The probabilistic communication complexity of set intersection. SIAM J. on Discrete Math. 5(4), 1992.
17. Kalyanasundaram, B., Schnitger, G., Communication complexity and lower bounds for sequential machines. In: Festschrift zum 60. Geburtstag von Gunter Hotz, Teubner Verlag, 840-849, 1992.
18. Karchmer, M., Wigderson, A., Monotone circuits for connectivity require super- logarithmic depth, SIAM J. on Disc. Math., 718-727, 1990.
19. Kolmogorov, A. N., Uspensky, V. A., On the definition of an algorithm. Russian Math. Surveys 30, 217-245, 1963.
20. Kushilevitz E., Nisan N., Communication Complexity. Cambridge University Press 1997.
21. Lengauer, Th., VLSI Theory. In: Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity, Elsevier, 835-868, 1990.
22. Li, M., Longpre, L., Vitanyi, P.M.B., On the Power of the Queue. Structure in Complexity Theory, Lecture Notes in Computer Science, vol. 223, 219-223, 1986.
23. Maass, W., Quadratic lower bounds for deterministic and nondeterministie one- Tape Turing machines. Proc. 16th Annual ACM Symp. on Theory of Computing, 401-408, 1984.
24. Maass, W., Schnitger, G., Szemeredi, E., Turan, G., Two tapes are better than one for off-line Turing machines. Computational Complexity 3, 392-401, 1993.
25. Lipton, R. J., Tarjan, R. E., Applications of a planar separator theorem. SIAM J. Computing 9, 615-627, 1980.
26. Lovasz, L., Communication Complexity: A Survey. In: Paths, Flow and VLSI Layout (Korte, Lovasz, Pr”omel, and Sehrijver, eds.), Springer-Verlag, 235-266, Berlin 1990.
27. Mehlhorn, K., Schmidt, E., Las Vegas is better than determinism in VLSI and distributed computing. Proc. 14th Annual ACM Symp. on Theory of Computing, 330-337, 1982.
28. Micali, S., Two-way deterministic finite automata are exponentially more succinct than sweeping automata. Information Processing Letters 12(2), 103-105, 1981.
29. Miltersen, P.B., Lower bounds for union-split-find related related problems on random access machines. Proc. 26th Annual ACM Symp. on Theory of Computing, 625-634, 1994.
30. Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A., On data structures and asymmetric communication complexity. Proc. 27th Annual ACM Symp. on Theory of Computing, 103-111, 1995.
31. Nisan, N., The communication complexity of threshold gates. Technical Report, Dept, of Comp. Sci., Hebrew Univ., 1994.
32. Nisan, N., Wigderson, A.: On rank versus communication complexity. Combinatorica 15, 557-565, 1995.
33. Orlitsky, A., El Gamal, A., Communication Complexity, In: Complexity in Information Theory (Y. Abu-Mostafa, ed.), Springer-Verlag 1988.
34. Raz, R., Wigderson, A., Monotone circuits for matching require linear depth, J. of the ACM 39(3), 736-744, 1992.
35. Razborov A. A., On the distributed complexity of disjointness, Theo. Comput. Sci. 106(2), 385-390, 1992.
36. Roychowdhury, V.P., Orlitzky, Siu K.Y., Lower bounds on threshold and related circuits via communication complexity. IEEE Transactions on Information Theory, 1994.
37. Schonhage, A. A., Storage modification machines. SIAM J. Computing 9, 490-508, 1980.
38. Thompson, C.D., A complexity theory for VLSI, Doctoral dissertation. CMU-CS- 80-140, Computer Science Department, Camegie-Mellon University, Pittsburgh, August 1980.
39. Turan, G., On the complexity of planar Boolean circuits. Computational Complexity, 1995.
40. Ullman, J. D., Computational Aspects of VLSI. Computer Science Press, 1984.
41. Wigderson, A., Information theoretic reasons for computational difficulty or communication complexity for circuit complexity. Proc. of the International Congress of Mathematicians, 1537-1548, 1990.
42. Yannakakis, M., Expressing combinatorial optimization problems by linear programs, J. of Comput. Syst. Sci. 43(3), 441-466, 1991.
43. Yao, A. C., Some complexity questions related to distributive computing. Proc. 11th Annual ACM Symp. on Theory of Computing, 209-213, 1979.
44. Yao, A.C., Should tables be sorted? J. of ACM 28, 615-628, 1981.