Selected Papers for Communication Complexity and Applications
Two-party communication complexity
-
Lokam.
"Complexity lower bounds using Linear Algebra"
Book Preprint.
[pdf]
[summary]
-
Sherstov.
"Communication Lower Bounds using Dual Polynomials."
Invited survey for The Bulletin of the European Association for
Theoretical Computer Science.
[pdf]
[summary]
-
Alexander A. Sherstov.
"The Pattern Matrix Method."
STOC 2008.
[pdf]
[summary]
-
Alexander A. Sherstov.
"Communication complexity under product and nonproduct distributions."
CCC 2008.
[pdf]
Separates product and nonproduct distributional complexity.
-
Toniann Pitassi.
Notes on "Best Partition Communication Complexity."
[ps]
[summary]
-
Ran Raz and Pierre McKenzie.
"Separation of the Monotone NC Hierarchy."
FOCS 1997.
[ps]
[summary]
-
Ran Raz.
"Exponential Separation of Quantum and Classical Communication
Complexity."
STOC 1999.
[ps]
[summary]
-
Ran Raz.
"The BNS-Chung Criterion for Multiparty Communication Complexity."
Journal of Computational Complexity 9(2), 2000.
[ps]
[summary]
-
Rahul Jain and Hartmut Klauck.
"The Partition Bound for Classical Communication Complexity and
Query Complexity."
CCC 2012.
[pdf]
Compares and relates several different lower bound techniques
for communication complexity. Develops one lower bound to rule
them all: the partition bound. Linear programs abound.
Information complexity
-
Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao.
"How to compress interactive communication."
STOC 2010.
[pdf]
The players use shared randomness to simulate the protocol, then
synchronize their simulations.
-
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays,
Jérémie Roland, and David Xiao.
"Lower bounds on information complexity via zero-communication
protocols and applications."
FOCS 2012.
[pdf]
If you're willing to let the error increase, then the players
might as well be playing solitaire (with option to abort).
-
Mark Braverman and Anup Rao.
"Information Equals Amortized Communication."
Submitted.
[pdf]
Does what the title says, for an amortization over infinitely
many instances.
-
Mark Braverman.
"Interactive information complexity."
STOC 2012.
[pdf]
[ECCC
version (no paywall)]
Develops a measure of information cost which works independent of input distribution.
-
Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew Yao.
"Information Complexity and the Direct Sum Problem for
Simultaneous Message Complexity."
FOCS 2001.
[pdf]
That direct sum problem everyone's talking about.
-
Mark Braverman and Omri Weinstein.
"A Discrepancy Lower Bound for Information Complexity."
LNCS 2012, Volume 7408, Approximation, Randomization, and
Combinatorial Optimization, p. 459-470.
[pdf]
[arXiv (no paywall)]
More lower bounds, more information complexity.
-
Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar.
"An information statistics approach to data stream and
communication complexity."
Journal of Computer and System Sciences, Volume 68,
p. 702-732, June 2004.
[pdf]
The paper that got everyone interested. "A real gem." - Toni
Privacy
-
Joan Feigenbaum, Aaron D. Jaggard, and Michael Schapira.
"Approximate Privacy: Foundations and Quantification (extended abstract)."
EC 2010.
[pdf]
(Full version split between
"Approximate Privacy: Foundations and Quantification"
[pdf]
and
"Approximate Privacy: PARs for Set Problems"
[pdf].)
Definition of PAR, a geometric concept of privacy. Upper bounds
for PAR of 2-player Vickrey auction, less than, set
disjointness, and set intersection.
-
Anil Ada, Arkadev Chattopadhyay, Stephen Cook, Lila Fontes, Michal
Koucký, and Toniann Pitassi.
"The Hardness of Being Private."
CCC 2012.
[pdf]
Lower bounds on communication-privacy tradeoffs for 2-player
Vickrey auctions using PAR and information cost. Relations
between various measures of privacy.
-
Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold,
Kunal Talwar, Salil Vadhan.
"The Limits of Two-Party Differential Privacy."
ECCC 18:106 (2011).
[pdf]
Relates information complexity to differential privacy.