On the public citation graph
Communication Complexity in a 3-Computer Model
0 signed · 56 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.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_5openalex-snapshot
Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-981-96-0668-9_16openalex-snapshot
A Survey: SWAP Test and Its Applications to Quantum Complexity Theory
inferred← citeshttps://doi.org/10.1007/s000370050018openalex-snapshot
On Randomized One-round Communication Complexity
inferred← citeshttps://doi.org/10.1007/s00224-015-9661-1openalex-snapshot
Distinguishing Two Probability Ensembles with One Sample from each Ensemble
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.01.014openalex-snapshot
The communication complexity of the Hamming distance problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.032openalex-snapshot
Public vs. private randomness in simultaneous multi-party communication complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00377-8openalex-snapshot
Quantum communication and complexity
inferred← citeshttps://doi.org/10.1023/a:1026009100467openalex-snapshot
Quantum Communication Complexity
inferred← citeshttps://doi.org/10.1038/s41467-021-24745-xopenalex-snapshot
Efficient experimental quantum fingerprinting with channel multiplexing and simultaneous detection
inferred← citeshttps://doi.org/10.1088/1367-2630/abc2e5openalex-snapshot
Multi-party quantum fingerprinting with weak coherent pulses: circuit design and protocol analysis
inferred← citeshttps://doi.org/10.1088/1751-8113/41/39/395309openalex-snapshot
The efficiency of quantum identity testing of multiple states
inferred← citeshttps://doi.org/10.1103/physreva.102.062608openalex-snapshot
Optical quantum communication complexity in the simultaneous-message-passing model
inferred← citeshttps://doi.org/10.1103/physreva.111.032617openalex-snapshot
Scalable and noise-robust communication advantage of multipartite quantum entanglement
inferred← citeshttps://doi.org/10.1103/physreva.69.022307openalex-snapshot
One-qubit fingerprinting schemes
inferred← citeshttps://doi.org/10.1103/physreva.71.012310openalex-snapshot
Quantum fingerprinting with a single particle
inferred← citeshttps://doi.org/10.1103/physreva.87.052330openalex-snapshot
swap test and Hong-Ou-Mandel effect are equivalent
inferred← citeshttps://doi.org/10.1103/physreva.89.062305openalex-snapshot
Quantum fingerprinting with coherent states and a constant mean number of photons
inferred← citeshttps://doi.org/10.1103/physreva.95.032337openalex-snapshot
Efficient quantum communications with coherent state fingerprints over multiple channels
inferred← citeshttps://doi.org/10.1103/physreva.99.062331openalex-snapshot
Quantum sketching protocols for Hamming distance and beyond
inferred← citeshttps://doi.org/10.1103/physrevlett.120.110502openalex-snapshot
Visibility-Based Hypothesis Testing Using Higher-Order Optical Interference
inferred← citeshttps://doi.org/10.1103/physrevresearch.3.043035openalex-snapshot
Optimal quantum-programmable projective measurements with coherent states
inferred← citeshttps://doi.org/10.1103/revmodphys.82.665openalex-snapshot
Nonlocality and communication complexity
inferred← citeshttps://doi.org/10.1103/v1fc-q1n9openalex-snapshot
Experimental Quantum Fingerprinting without the Shared Randomness Loophole
inferred← citeshttps://doi.org/10.1109/ccc.1997.612319openalex-snapshot
Randomized simultaneous messages: solution of a problem of Yao in communication complexity
inferred← citeshttps://doi.org/10.1109/ccc.2006.39openalex-snapshot
Strengths and Weaknesses of Quantum Fingerprinting
inferred← citeshttps://doi.org/10.1109/focs.2016.14openalex-snapshot
Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics
inferred← citeshttps://doi.org/10.1109/jsac.2020.2968996openalex-snapshot
Quantum Fingerprinting Over AWGN Channels With Power-Limited Optical Signals
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959901openalex-snapshot
Informational complexity and the direct sum problem for simultaneous message complexity
inferred← citeshttps://doi.org/10.1117/12.2325073openalex-snapshot
Feasibility of quantum fingerprinting using optical signals with random global phase
inferred← citeshttps://doi.org/10.1137/060665798openalex-snapshot
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity
inferred← citeshttps://doi.org/10.1137/1.9781611973402.136openalex-snapshot
Efficient quantum protocols for XOR functions
inferred← citeshttps://doi.org/10.1142/s0219749907003171openalex-snapshot
QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
inferred← citeshttps://doi.org/10.1145/1132516.1132602openalex-snapshot
Bounded-error quantum state identification and exponential separations in communication complexity
inferred← citeshttps://doi.org/10.1145/225058.225277openalex-snapshot
On randomized one-round communication complexity
inferred← citeshttps://doi.org/10.1145/3212734.3212772openalex-snapshot
Distributed Uniformity Testing
inferred← citeshttps://doi.org/10.1145/3519270.3538438openalex-snapshot
Overcoming Congestion in Distributed Coloring
inferred← citeshttps://doi.org/10.1145/780542.780554openalex-snapshot
On the power of quantum fingerprinting
inferred← citeshttps://doi.org/10.1145/780551.780554openalex-snapshot
On the power of quantum fingerprinting
inferred← citeshttps://doi.org/10.22364/bjmc.2016.4.4.04openalex-snapshot
Four Collaborations with Rūsiņš Freivalds
inferred← citeshttps://doi.org/10.26421/qic4.2-6openalex-snapshot
Distributed construction of quantum fingerprints
inferred← citeshttps://doi.org/10.26421/qic5.3-6openalex-snapshot
Classical and quantum fingerprinting with shared randomness and one-sided error
inferred← citeshttps://doi.org/10.26421/qic7.3-5openalex-snapshot
Optimal fingerprinting strategies with one-sided error
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2016.15openalex-snapshot
On the Sensitivity Conjecture for Disjunctive Normal Forms
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2017.51openalex-snapshot
Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers
inferred← citeshttps://doi.org/10.48550/arxiv.0807.2758openalex-snapshot
Simultaneous Communication Protocols with Quantum and Classical Messages
inferred← citeshttps://doi.org/10.48550/arxiv.1710.01969openalex-snapshot
Simultaneous Multiparty Communication Complexity of Composed Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1907.09415openalex-snapshot
Quantum Computing: Lecture Notes
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0411051openalex-snapshot
Quantum Communication Cannot Simulate a Public Coin
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0511013openalex-snapshot
Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0603173openalex-snapshot
Strengths and Weaknesses of Quantum Fingerprinting
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.