Everything about Multiparty communication complexity

🧭 Start here: a 6-step reading path

1. Read the overview: Multiparty communication complexityA 5-minute orientation
2. Skim a recent paper: Multiparty Threshold Private Set Intersection Protocol with Low Communication ComplexityInfluential work since 2022
3. Pick up a classic book: Class actions and other multi-party litigation in a nutshellThe most-reprinted book on the subject
4. Read the landmark paper: Multiparty quantum communication complexityCited 82 times
5. Go sideways: Circuit complexityA closely related topic
6. Go sideways: Conditional disclosure of secretsA closely related topic

🏆 Landmark papers (most cited)

• Multiparty quantum communication complexity

  Harry Buhrman, Wim van Dam, Peter Høyer · 1999 · Physical Review A · 82 citations

• Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity

  Paul Beame, Toniann Pitassi, Nathan Segerlind · 2007 · SIAM Journal on Computing · 36 citations

• A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness

  Paul Beame, Toniann Pitassi, Nathan Segerlind · 2006 · computational complexity · 35 citations

• Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremath{\sfAC}^0$

  Paul Beame, Trinh Huynh · 2012 · SIAM Journal on Computing · 17 citations

• Some bounds on multiparty communication complexity of pointer jumping

  C. Damm, S. Jukna, J. Sgall · 1998 · Computational Complexity · 15 citations

• The Multiparty Communication Complexity of Set Disjointness

  Alexander A. Sherstov · 2016 · SIAM Journal on Computing · 14 citations

• Lower Bounds on the Multiparty Communication Complexity

  Pavol Ďuriš, José D.P. Rolim · 1998 · Journal of Computer and System Sciences · 10 citations

• Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy

  Jeff M. Phillips, Elad Verbin, Qin Zhang · 2016 · SIAM Journal on Computing · 9 citations

🆕 Influential since 2022

• Multiparty Threshold Private Set Intersection Protocol with Low Communication Complexity

  Xiaopeng Yu, Fagen Li, Wei Zhao · 2022 · Security and Communication Networks · 4 citations

📚 Books worth reading

• Class actions and other multi-party litigation in a nutshellRobert H. Klonoff · 1999
• Wireless Sensor NetworksPiet Demeester · 2013
• Information Theory, Combinatorics, and Search TheoryHarout Aydinian · 2013
• 📕PODC 2006Colo.) ACM Symposium on Principles of Distributed Computing (25th 2006 Denver · 2006
• A TOUR OF THE WORLDMalik Mansab Khan, Muhammad Rafique Abdul Aziz · 2025

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Circuit complexity In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according…
• Conditional disclosure of secrets Conditional disclosure of secrets (CDS) is a primitive, studied in information-theoretic cryptography, that allows distributed, non-communicating parties…
• Private simultaneous message passing Private simultaneous message passing (PSM) is a primitive, studied in information-theoretic cryptography, which allows multiple, non-communicating, parties…
• Decision tree model In computational complexity theory, the decision tree model is the model of computation in which an algorithm can be considered to be a decision tree,…
• Communication complexity In theoretical computer science, communication complexity studies the amount of communication required to solve a problem when the input to the problem…
• Hidden matching problem In quantum information, the hidden matching problem is a computational complexity problem that can be solved using quantum protocols: Let n {\displaystyle…
• Locally testable code A locally testable code is a type of error-correcting code for which it can be determined if a string is a word in that code by looking at a small (frequently…
• Locally decodable code A locally decodable code (LDC) is an error-correcting code that allows a single bit of the original message to be decoded with high probability by only…