Nikos Leonardos, Michael Saks. Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. Computational Complexity, 19(2):153-181, 2010. [doi]
@article{LeonardosS10,
title = {Lower Bounds on the Randomized Communication Complexity of Read-Once Functions},
author = {Nikos Leonardos and Michael Saks},
year = {2010},
url = {http://springerlink.metapress.com/content/y42hkrn487280635/},
researchr = {https://researchr.org/publication/LeonardosS10},
cites = {0},
citedby = {0},
journal = {Computational Complexity},
volume = {19},
number = {2},
pages = {153-181},
}