[1]
G. S. Brodal og T. Husfeldt, “A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth”, BRICS, bd. 3, nr. 1, jan. 1996.