Rectangle Size Bounds and Threshold Covers in Communication Complexity.

Hartmut Klauck Rectangle Size Bounds and Threshold Covers in Communication Complexity. 118-134 2003 conf/coco/2003 IEEE Conference on Computational Complexity http://csdl.computer.org/comp/proceedings/complexity/2003/1879/00/18790118abs.htm db/conf/coco/coco2003.html#Klauck03