On randomized one-round communication complexity.

Ilan Kremer, Noam Nisan, Dana Ron

Browse the full STOC paper archive.