Fetching the paper…
Reading the bibliography…
In this paper, we show a direct product theorm in the model of two-party bounded-round public-coin randomized communication complexity.
Some complexity questions related to distributive computing (preliminary report)
Andrew Chi-Chih Yao · 1979
Earlier work this paper cites.
Theory and applications of trapdoor functions
Andrew Chi-Chih Yao · 1982
Earlier work this paper cites.
Elements of Information Theory
Thomas M. Cover and Joy A. Thomas · 1991
Earlier work this paper cites.
Rounds in communication complexity revisited
Noam Nisan and Avi Widgerson · 1991
Earlier work this paper cites.
On the distributional complexity of disjointness
A. Razborov · 1992
Earlier work this paper cites.
A parallel repetition theorem
Ran Raz · 1995
Earlier work this paper cites.
Communication Complexity
Eyal Kushilevitz and Noam Nisan · 1996
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.
Products and help bits in decision trees
Noam Nisan, Steven Rudich, and Michael Saks · 1999
Earlier work this paper cites.
On quantum and probabilistic communication: Las vegas and one-way protocols
Hartmut Klauck · 2000
Earlier work this paper cites.
Informational complexity and the direct sum problem for simultaneous message complexity
A. Chakrabarti · 2001
Earlier work this paper cites.
Interaction in quantum communication and the complexity of set disjointness
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, and David Zuckerman · 2001
Earlier work this paper cites.
The communication complexity of pointer chasing
Stephen J. Ponzio, Jaikumar Radhakrishnan, and S. Venkatesh · 2001
Cited alongside, same era.
An information statistics approach to data stream and communication complexity
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar · 2002
Cited alongside, same era.
The quantum communication complexity of the pointer chasing problem: The bit version
Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen · 2002
Cited alongside, same era.
A direct sum theorem in communication complexity via message compression
Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen · 2003
Cited alongside, same era.
A lower bound for the bounded round quantum communication complexity of set disjointness
Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen · 2003
Cited alongside, same era.
Quantum and classical strong direct product theorems and optimal time-space tradeoffs
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract
Rahul Jain, Hartmut Klauck, and Ashwin Nayak · 2008
Later among the works it cites.
A direct product theorem for discrepancy
Troy Lee, Adi Shraibman, and Robert Špalek · 2008
Later among the works it cites.
Norms, xor lemmas, and lower bounds for poly- nomials and protocols
Emanuele Viola and Avi Wigderson · 2008
Later among the works it cites.
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
Andris Ambainis, Robert Špalek, and Ronald de Wolf · 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
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hartmut Klauck, Robert Špalek, and Ronald de Wolf · 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.
Towards proving strong direct product theorems
Ronen Shaltiel · 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.
Parallel repetition: simplifications and the no-signaling case
Thomas Holenstein · 2007
Cited alongside, same era.
A hypercontractive inequality for matrix-valued functions with applications to quantum computing
Avraham Ben-Aroya, Oded Regev, and Ronald de Wolf · 2008
Cited alongside, same era.
Robustness of quantum markov chains
Ben Ibinson, Noah Linden, and Andreas Winter · 2008
Cited alongside, same era.
Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao · 2010
Later among the works it cites.
A strong direct product theorem for disjointness
Hartmut Klauck · 2010
Later among the works it cites.
Information equals amortized communication
Mark Braverman and Anup Rao · 2011
Later among the works it cites.
Improved direct product theorems for randomized query complexity
Andrew Drucker · 2011
Later among the works it cites.
New strong direct product results in communication complexity
Rahul Jain · 2011
Later among the works it cites.
A strong direct product theorem for quantum query complexity
Troy Lee and Jérémie Roland · 2011
Later among the works it cites.
Strong direct product theorems for quantum communication and query complexity
Alexander A. Sherstov · 2011
Later among the works it cites.