Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication ComplexityRahul Jain, Attila Pereszlényi, Penghui Yao. focs 2012: 167-176 [doi] A direct product theorem for quantum communication complexity with applications to device-independent QKDRahul Jain 0001, Srijita Kundu. eccc, 28:78, 2021. [doi] A direct product theorem for quantum communication complexity with applications to device-independent QKDRahul Jain 0001, Srijita Kundu. focs 2022: 1285-1295 [doi]
The following publications are possibly variants of this publication: