Nati Linial, Adi Shraibman. Lower bounds in communication complexity based on factorization norms. In David S. Johnson, Uriel Feige, editors, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007. pages 699-708, ACM, 2007. [doi]
Abstract is missing.