Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity

[1]  Farid M. Ablayev.  Lower Bounds for Probabilistic Space Complexity: Communication-Automata Approach , 1994, LFCS.

[2]  F. Ablayev.  Lower Bounds for One-way Probabilistic Communication Complexity , 1993, International Colloquium on Automata, Languages and Programming.

[3]  Alexander A. Razborov,et al.  Majority gates vs. general weighted threshold gates , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[4]  Noam Nisan,et al.  Rounds in communication complexity revisited , 1991, STOC '91.

[5]  Rusins Freivalds.  Complexity of Probabilistic Versus Deterministic Automata , 1991, Baltic Computer Science.

[6]  Thomas Lengauer.  VLSI Theory , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[7]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[8]  Alexander Schrijver,et al.  Paths, Flows, and VLSI-Layout , 1990 .

[9]  Carl A. Gunter,et al.  In handbook of theoretical computer science , 1990 .

[10]  Farid M. Ablayev.  On Comparing Probabilistic and Deterministic Automata Complexity of Languages , 1989, MFCS.

[11]  Tak Wah Lam,et al.  Results on communication complexity classes , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[12]  Rüdiger Reischuk,et al.  On Different Modes of Communication (Extended Abstract) , 1988, STOC 1988.

[13]  Rusins Freivalds,et al.  Why Sometimes Probabilistic Algorithms Can Be More Effective , 1996, MFCS.

[14]  Janos Simon,et al.  Probabilistic Communication Complexity , 1986, J. Comput. Syst. Sci..

[15]  A. Selman.  Structure in Complexity Theory , 1986, Lecture Notes in Computer Science.

[16]  Oded Goldreich,et al.  Unbiased bits from sources of weak randomness and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[17]  Vojtech Rödl,et al.  Geometrical realization of set systems and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Zvi Galil,et al.  Lower bounds on communication complexity , 1984, STOC '84.

[19]  Viktor K. Prasanna,et al.  Information Transfer under Different Sets of Protocols , 1984, SIAM J. Comput..

[20]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[21]  Christos H. Papadimitriou,et al.  Communication complexity , 1982, STOC '82.

[22]  Rusins Freivalds,et al.  Fast Probabilistic Algorithms , 1979, MFCS.

[23]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[24]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[25]  Neil Immerman,et al.  One-way log-tape reductions , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[26]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[27]  Phan Dinh Dieu.  On a Neccessary Condition for Stochastic Languages , 1972, J. Inf. Process. Cybern..

[28]  R. Gallager.  Information Theory and Reliable Communication , 1968 .