On randomized one-round communication complexity

Ilan Kremer, Noam Nisan, Dana Ron. On randomized one-round communication complexity. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 596-605, ACM, 1995. [doi]

Authors

Ilan Kremer

This author has not been identified. Look up 'Ilan Kremer' in Google

Noam Nisan

This author has not been identified. Look up 'Noam Nisan' in Google

Dana Ron

This author has not been identified. Look up 'Dana Ron' in Google