Communication Complexity and Lower Bounds on Multilective ComputationsJuraj HromkovičRAIRO-Theor. Inf. Appl., 33 2 (1999) 193-212DOI: https://doi.org/10.1051/ita:1999113
