Communication Complexity

This publication has 24 references indexed in Scilit:

• Amortized Communication Complexity
  SIAM Journal on Computing, 1995
• The Bns Lower-Bound for Multiparty Protocols Is Nearly Optimal
  Information and Computation, 1994
• Different Modes of Communication
  SIAM Journal on Computing, 1993
• The Probabilistic Communication Complexity of Set Intersection
  SIAM Journal on Discrete Mathematics, 1992
• Symbolic Boolean manipulation with ordered binary-decision diagrams
  ACM Computing Surveys, 1992
• Lower bounds to the complexity of symmetric Boolean functions
  Theoretical Computer Science, 1990
• A counterexample to the rank‐coloring conjecture
  Journal of Graph Theory, 1989
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
  SIAM Journal on Computing, 1988
• Lower bounds on communication complexity
  Information and Computation, 1987
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986