No article text was recorded for this version.
multi-party communication lower bounds
Version 1 of 111 papers15 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On the Communication Complexity of High-Dimensional Permutations
- Blog: On The Communication Complexity of Linear Algebraic Problems in the Message Passing Model
- Blog: Inner Product and Set Disjointness: Beyond Logarithmically Many Parties
- Blog: Bounded Collusion Protocols, Cylinder-Intersection Extractors and Leakage-Resilient Secret Sharing
- Blog: Communication Complexity (for Algorithm Designers)
- Blog: Communication Lower Bounds via Critical Block Sensitivity
- Blog: Hardness Amplification in Proof Complexity
- Blog: Separating NOF communication complexity classes RP and NP
- Blog: Explicit separations between randomized and deterministic Number-on-Forehead communication
- Blog: Matrix Multiplication and Number On the Forehead Communication
- Blog: Gadgetless Lifting Beats Round Elimination: Improved Lower Bounds for Pointer Chasing
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_multi_party_communication_lower_bounds_ff775614,
title = {multi-party communication lower bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/multi-party-communication-lower-bounds/rdr_ff7756146457416db7b4f2645f511df3},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_multi_party_communication_lower_bounds_ff775614_v1,
title = {multi-party communication lower bounds},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/multi-party-communication-lower-bounds/rdr_ff7756146457416db7b4f2645f511df3/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}