On the public citation graph
Circuits and multi-party protocols
0 signed · 39 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.1006/inco.1994.1051openalex-snapshot
The Bns Lower-Bound for Multiparty Protocols Is Nearly Optimal
inferredcites →https://doi.org/10.1007/bf01137685openalex-snapshot
Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
inferredcites →https://doi.org/10.1007/bf01272517openalex-snapshot
On the power of small-depth threshold circuits
inferredcites →https://doi.org/10.1016/0304-3975(92)90260-mopenalex-snapshot
On the distributional complexity of disjointness
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1109/sfcs.1991.185448openalex-snapshot
Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in
inferredcites →https://doi.org/10.1145/100216.100253openalex-snapshot
Monotone circuits for matching require linear depth
inferredcites →https://doi.org/10.1145/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
inferredcites →https://doi.org/10.1145/12130.12132openalex-snapshot
Almost optimal lower bounds for small depth circuits
inferredcites →https://doi.org/10.1145/28395.28404openalex-snapshot
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1995.1069openalex-snapshot
Separating the Communication Complexities of MOD m and MOD p Circuits
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_147openalex-snapshot
Harmonic analysis, real approximation, and the communication complexity of Boolean functions
inferred← citeshttps://doi.org/10.1007/978-1-4612-1388-8_12openalex-snapshot
Multiparty Communication Complexity of Finite Monoids
inferred← citeshttps://doi.org/10.1007/pl00009265openalex-snapshot
Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions
inferred← citeshttps://doi.org/10.1007/s00037-013-0078-4openalex-snapshot
The NOF Multiparty Communication Complexity of Composed Functions
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00204-3openalex-snapshot
Constructing set systems with prescribed intersection sizes
inferred← citeshttps://doi.org/10.1017/9781108671644.016openalex-snapshot
Extension Complexity of Polytopes
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267764openalex-snapshot
Separating the communication complexities of MOD m and MOD p circuits
inferred← citeshttps://doi.org/10.1142/s0129054110007386openalex-snapshot
ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES
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.