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]
Abstract is missing.