Communication Complexity and Lower Bounds on Multilective Computations Juraj Hromkovič RAIRO-Theor. Inf. Appl., 33 2 (1999) 193-212 Published online: 15 August 2002 DOI: 10.1051/ita:1999113