<?xml version="1.0"?>
<dblp>
<inproceedings key="conf/coco/BeamePSW05" mdate="2005-07-25">
<author>Paul Beame</author>
<author>Toniann Pitassi</author>
<author>Nathan Segerlind</author>
<author>Avi Wigderson</author>
<title>A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness.</title>
<pages>52-66</pages>
<year>2005</year>
<crossref>conf/coco/2005</crossref>
<booktitle>IEEE Conference on Computational Complexity</booktitle>
<ee>http://dx.doi.org/10.1109/CCC.2005.1</ee>
<url>db/conf/coco/coco2005.html#BeamePSW05</url>
</inproceedings>
</dblp>
