[1]
G. S. Brodal and T. Husfeldt, “A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth”, BRICS, vol. 3, no. 1, Jan. 1996.