Communication Complexity

[1]  Rafail Ostrovsky,et al.  The Linear-Array Conjecture in Communication Complexity Is False , 1996, STOC '96.

[2]  Michael Sipser,et al.  Monotone Separation of Logarithmic Space from Logarithmic Depth , 1995, J. Comput. Syst. Sci..

[3]  Peter Bro Miltersen,et al.  On data structures and asymmetric communication complexity , 1994, STOC '95.

[4]  T. Kailath,et al.  Discrete Neural Computation: A Theoretical Foundation , 1995 .

[5]  Vince Grolmusz,et al.  The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal , 1994, Inf. Comput..

[6]  Peter Bro Miltersen.  Lower bounds for union-split-find related problems on random access machines , 1994, STOC '94.

[7]  Alon Orlitsky,et al.  Lower bounds on threshold and related circuits via communication complexity , 1994, IEEE Trans. Inf. Theory.

[8]  Mikael Goldmann,et al.  Communication Complexity and Lower Bounds for Threshold Circuits , 1994 .

[9]  Martin Dietzfelbinger,et al.  A Comparison of Two Lower Bound Methods for Communication Complexity , 1994, MFCS.

[10]  Ran Raz,et al.  On the "log rank"-conjecture in communication complexity , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[11]  Vojtech Rödl,et al.  Modified ranks of tensors and the size of circuits , 1993, STOC '93.

[12]  N. Nisan.  The communication complexity of threshold gates , 1993 .

[13]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[14]  A. A. Razborov.  The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear , 1992, Discret. Math..

[15]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[16]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[17]  Eyal Kushilevitz,et al.  Fractional covers and communication complexity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[18]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[19]  T. Feder,et al.  Amortized communication complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[20]  Russell Impagliazzo,et al.  Communication complexity towards lower bounds on circuit depth , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[21]  Ilan Newman,et al.  Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..

[22]  György Turán,et al.  On Linear Decision Trees Computing Boolean Functions , 1991, ICALP.

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

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

[25]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[26]  Vojtech Rödl,et al.  Lower Bounds to the Complexity of Symmetric Boolean Functions , 1990, Theor. Comput. Sci..

[27]  Ran Raz,et al.  Monotone circuits for matching require linear depth , 1990, STOC '90.

[28]  Alexander A. Razborov,et al.  Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..

[29]  Noga Alon,et al.  A counterexample to the rank-coloring conjecture , 1989, J. Graph Theory.

[30]  Mauricio Karchmer,et al.  Communication complexity - a new approach to circuit depth , 1989 .

[31]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[32]  Noga Alon,et al.  Meanders and Their Applications in Lower Bounds Arguments , 1988, J. Comput. Syst. Sci..

[33]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[34]  Rüdiger Reischuk,et al.  On different modes of communication , 1988, STOC '88.

[35]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[36]  R. Bryant.  Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .

[37]  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).

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

[39]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[40]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[41]  Richard J. Lipton,et al.  Lower bounds for VLSI , 1981, STOC '81.

[42]  C. Thomborson.  Area-Time Complexity for VLSI , 1979, STOC.

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

[44]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[45]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[46]  Alan Cobham,et al.  The Recognition Problem for the Set of Perfect Squares , 1966, SWAT.