On the public citation graph
The BNS-Chung criterion for multi-party communication complexity
0 signed · 78 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240010401openalex-snapshot
Quasi‐random classes of hypergraphs
inferredcites →https://doi.org/10.1007/bf01272517openalex-snapshot
On the power of small-depth threshold circuits
inferredcites →https://doi.org/10.1109/fscs.1990.89583openalex-snapshot
ON ACC and threshold circuits
inferredcites →https://doi.org/10.1137/0222016openalex-snapshot
Rounds in Communication Complexity Revisited
inferredcites →https://doi.org/10.1137/0406009openalex-snapshot
Communication Complexity and Quasi Randomness
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11523468_94openalex-snapshot
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/11821069_40openalex-snapshot
NOF-Multiparty Information Complexity Bounds for Pointer Jumping
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_3openalex-snapshot
Position-Based Cryptography and Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_43openalex-snapshot
Languages with Bounded Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_28openalex-snapshot
Quantum Multiparty Communication Complexity and Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_14openalex-snapshot
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_30openalex-snapshot
Improved Separations between Nondeterministic and Randomized Multiparty Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-24508-4openalex-snapshot
Boolean Function Complexity: Advances and Frontiers
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_39openalex-snapshot
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_2openalex-snapshot
The NOF Multiparty Communication Complexity of Composed Functions
inferred← citeshttps://doi.org/10.1007/s00037-007-0220-2openalex-snapshot
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness
inferred← citeshttps://doi.org/10.1007/s00037-009-0276-2openalex-snapshot
Disjointness is Hard in the Multiparty Number-on-the-Forehead Model
inferred← citeshttps://doi.org/10.1007/s00037-012-0052-6openalex-snapshot
Hadamard tensors and lower bounds on multiparty communication complexity
inferred← citeshttps://doi.org/10.1007/s00037-013-0078-4openalex-snapshot
The NOF Multiparty Communication Complexity of Composed Functions
inferred← citeshttps://doi.org/10.1007/s00493-009-2667-zopenalex-snapshot
One-way multiparty communication lower bound for pointer jumping with applications
inferred← citeshttps://doi.org/10.1007/s00493-014-3078-3openalex-snapshot
The communication complexity of addition
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.03.005openalex-snapshot
Hellinger volume and number-on-the-forehead communication complexity
inferred← citeshttps://doi.org/10.1017/s0960129508007263openalex-snapshot
Quantum multiparty communication complexity and circuit lower bounds
inferred← citeshttps://doi.org/10.1109/ccc.2005.1openalex-snapshot
A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness
inferred← citeshttps://doi.org/10.1109/ccc.2007.15openalex-snapshot
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
inferred← citeshttps://doi.org/10.1109/ccc.2008.25openalex-snapshot
A Direct Product Theorem for Discrepancy
inferred← citeshttps://doi.org/10.1109/ccc.2008.29openalex-snapshot
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model
inferred← citeshttps://doi.org/10.1109/ccc.2009.24openalex-snapshot
Lower Bounds on Quantum Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1109/focs.2007.34openalex-snapshot
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
inferred← citeshttps://doi.org/10.1109/focs.2007.4389513openalex-snapshot
One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications
inferred← citeshttps://doi.org/10.1109/focs.2007.51openalex-snapshot
A Brief Look at Pairings Based Cryptography
inferred← citeshttps://doi.org/10.1109/focs.2009.12openalex-snapshot
Multiparty Communication Complexity and Threshold Circuit Size of AC^0
inferred← citeshttps://doi.org/10.1109/focs.2016.39openalex-snapshot
The Multiparty Communication Complexity of Interleaved Group Products
inferred← citeshttps://doi.org/10.1109/focs.2019.00045openalex-snapshot
Leakage-Resilient Secret Sharing Against Colluding Parties
inferred← citeshttps://doi.org/10.1109/tcset.2018.8336206openalex-snapshot
Multichannel system for structuring and transmission entropy-manipulated cipher signals
inferred← citeshttps://doi.org/10.1137/08071421xopenalex-snapshot
Separating ${AC}^0$ from Depth-2 Majority Circuits
inferred← citeshttps://doi.org/10.1137/1.9781611973105.46openalex-snapshot
The communication complexity of addition
inferred← citeshttps://doi.org/10.1137/100792779openalex-snapshot
Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremath{\sfAC}^0$
inferred← citeshttps://doi.org/10.1137/25m1806855openalex-snapshot
Spreadness Implies Mixing: A New Variant of Structure vs. Randomness
inferred← citeshttps://doi.org/10.1145/1250790.1250834openalex-snapshot
Separating AC 0 from depth-2 majority circuits
inferred← citeshttps://doi.org/10.1145/1556154.1556169openalex-snapshot
SIGACT news complexity theory column 63
inferred← citeshttps://doi.org/10.1145/1595391.1595392openalex-snapshot
Improved Separations between Nondeterministic and Randomized Multiparty Communication
inferred← citeshttps://doi.org/10.1145/1855118.1855133openalex-snapshot
The story of set disjointness
inferred← citeshttps://doi.org/10.1145/1855118.1886592openalex-snapshot
SIGACT News Complexity Theory Column 67
inferred← citeshttps://doi.org/10.1145/2488608.2488640openalex-snapshot
Shielding circuits with groups
inferred← citeshttps://doi.org/10.1145/2746539.2746560openalex-snapshot
The communication complexity of interleaved group products
inferred← citeshttps://doi.org/10.1145/3618260.3649721openalex-snapshot
Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication
inferred← citeshttps://doi.org/10.1145/509907.510006openalex-snapshot
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
inferred← citeshttps://doi.org/10.1561/0400000033openalex-snapshot
On the Power of Small-Depth Computation
inferred← citeshttps://doi.org/10.1561/0400000040openalex-snapshot
Lower Bounds in Communication Complexity
inferred← citeshttps://doi.org/10.1561/9781601982599openalex-snapshot
Lower Bounds in Communication Complexity
inferred← citeshttps://doi.org/10.1561/9781601983015openalex-snapshot
On the Power of Small-Depth Computation
inferred← citeshttps://doi.org/10.17760/d20005081openalex-snapshot
Towards bridging theory and implementation of cryptographic primitives
inferred← citeshttps://doi.org/10.17877/de290r-14220openalex-snapshot
Information Complexity and Data Stream Algorithms for Basic Problems
inferred← citeshttps://doi.org/10.23939/csn2016.857.017openalex-snapshot
Теоретичні засади методу оцінювання ентропії структуризованих поліфункціональних даних
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2021.37openalex-snapshot
A Simple Proof of a New Set Disjointness with Applications to Data Streams
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.80openalex-snapshot
Group representations that resist worst-case sampling
inferred← citeshttps://doi.org/10.48550/arxiv.0801.3624openalex-snapshot
Multiparty Communication Complexity of Disjointness
inferred← citeshttps://doi.org/10.48550/arxiv.0802.3860openalex-snapshot
Separating NOF communication complexity classes RP and NP
inferred← citeshttps://doi.org/10.48550/arxiv.0805.2135openalex-snapshot
Communication Lower Bounds Using Dual Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0817openalex-snapshot
A Separation of NP and coNP in Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1710.01969openalex-snapshot
Simultaneous Multiparty Communication Complexity of Composed Functions
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0504087openalex-snapshot
Quantum multiparty communication complexity and circuit lower bounds
inferred← citeshttps://doi.org/10.7282/t3bv7fncopenalex-snapshot
Information theory methods in communicationcomplexity
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.