Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity

Elements of Information Theory

Thomas M. Cover and Joy A. Thomas · 1991

Earlier work this paper cites.

A direct product theorem

Russell Impagliazzo, Ran Raz, and Avi Wigderson · 1994

Earlier work this paper cites.

Communication Complexity

Eyal Kushilevitz and Noam Nisan · 1997

Earlier work this paper cites.

Direct product results and the GCD problem, in old and new communication models

Itzhak Parnafes, Ran Raz, and Avi Wigderson · 1997

Earlier work this paper cites.

Informational complexity and the direct sum problem for simultaneous message complexity

Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew C.-C. Yao · 2001

Earlier work this paper cites.

A direct sum theorem in communication complexity via message compression

Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen · 2003

Earlier work this paper cites.

Towards proving strong direct product theorems

Original

Ronen Shaltiel · 2003

Cited alongside, same era.

Quantum and classical communication-space tradeoffs from rectangle bounds

Hartmut Klauck · 2004

Cited alongside, same era.

Quantum and classical strong direct product theorems and optimal time-space tradeoffs

Hartmut Klauck, Robert Špalek, and Ronald de Wolf · 2004

Cited alongside, same era.

Prior entanglement, message compression and privacy in quantum communication

Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen · 2005

Cited alongside, same era.

A direct sum theorem for corruption and a lower bound for the multiparty communication complexity of Set Disjointness

Paul Beame, Toniann Pitassi, Nathan Segerlind, and Avi Wigderson · 2007

Cited alongside, same era.

Direct product theorems for classical communication complexity via subdistribution bounds

Rahul Jain, Hartmut Klauck, and Ashwin Nayak · 2008

Later among the works it cites.

The communication complexity of correlation

Prahladh Harsha, Rahul Jain, David McAllester, and Jaikumar Radhakrishnan · 2009

Later among the works it cites.

New results in the simultaneous message passing model via information theoretic techniques

Rahul Jain and Hartmut Klauck · 2009

Later among the works it cites.

How to compress interactive communication

X. Chen B. Barak, M. Braverman and A. Rao · 2010

Closest in time.

Efficient communication using partial information

M. Braverman and A. Rao · 2010

Closest in time.

A strong direct product theorem for disjointness

Hartmut Klauck · 2010

Closest in time.