Hartmut Klauck. Rectangle Size Bounds and Threshold Covers in Communication Complexity. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark. pages 118-134, IEEE Computer Society, 2003. [doi]
Abstract is missing.