A linear array network consists of k + 1 processors Po, Pi,..., Pk with links only between Pi and Pi+l (O s i < k). It is required to compute some boolean function ~(~, y) in this network, where z is initially stored at P. and y at Jk, Let Dk(~) be the (total) number of bits that must be exchanged to compute ~ in worst case. Clearly, 11~(~) < k . D(f… (More)

@inproceedings{Kushilevitz1996TheLC,
title={The Linear-Array Conjecture in Communication Complexity is False},
author={Eyal Kushilevitz and Nathan Linial and Rafail Ostrovsky},
booktitle={STOC},
year={1996}
}