Amortized communication complexity

This publication has 14 references indexed in Scilit:

• Two messages are almost optimal for conveying information
  Published by Association for Computing Machinery (ACM) ,1990
• Small-bias probability spaces: efficient constructions and applications
  Published by Association for Computing Machinery (ACM) ,1990
• Monotone circuits for matching require linear depth
  Published by Association for Computing Machinery (ACM) ,1990
• On the extended direct sum conjecture
  Published by Association for Computing Machinery (ACM) ,1989
• Monotone circuits for connectivity require super-logarithmic depth
  Published by Association for Computing Machinery (ACM) ,1988
• Meshes with multiple buses
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• Storing a Sparse Table with 0 (1) Worst Case Access Time
  Journal of the ACM, 1984
• On the complexity of 2-output Boolean networks
  Theoretical Computer Science, 1981
• The zero-error side information problem and chromatic numbers (Corresp.)
  IEEE Transactions on Information Theory, 1976
• Realizing Boolean functions on disjoint sets of variables
  Theoretical Computer Science, 1976