Amit Chakrabarti Subhash Khot Xiaodong Sun Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. 107-117 2003 conf/coco/2003 IEEE Conference on Computational Complexity http://csdl.computer.org/comp/proceedings/complexity/2003/1879/00/18790107abs.htm db/conf/coco/coco2003.html#ChakrabartiKS03