Journal of the ACM Bibliography

Selected papers that cite this one

• Zhi-Quan Luo. One-way communication complexity of computing a collection of rational functions. Journal of Complexity, 10(2):179-198, June 1994.

Selected references

• Harold Abelson. Lower bounds on information transfer in distributed computations. Journal of the ACM, 27(2):384-392, April 1980.

• Alfred V. Aho, Jeffrey D. Ullman, and Mihalis Yannakakis. On notions of information transfer in VLSI circuits. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 133-139, Boston, Massachusetts, 25-27 April 1983.

• Ashok K. Chandra, Merrick L. Furst, and Richard J. Lipton. Multi-party protocols. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 94-99, Boston, Massachusetts, 25-27 April 1983.

• Kurt Mehlhorn and Erik M. Schmidt. Las Vegas is better than determinism in VLSI and distributed computing (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 330-337, San Francisco, California, 5-7 May 1982.

• Christos H. Papadimitriou and Michael Sipser. Communication complexity. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 196-200, San Francisco, California, 5-7 May 1982.

• Andrew Chi-Chih Yao. Some complexity questions related to distributive computing (preliminary report). In Conference Record of the Eleventh Annual ACM Symposium on Theory of Computing, pages 209-213, Atlanta, Georgia, 30 April-2 May 1979.

Shortcuts: