Rahul Jain 0001, Attila Pereszlényi, Penghui Yao. A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. Algorithmica, 76(3):720-748, 2016. [doi]
@article{JainPY16,
title = {A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity},
author = {Rahul Jain 0001 and Attila Pereszlényi and Penghui Yao},
year = {2016},
doi = {10.1007/s00453-015-0100-0},
url = {http://dx.doi.org/10.1007/s00453-015-0100-0},
researchr = {https://researchr.org/publication/JainPY16},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {76},
number = {3},
pages = {720-748},
}