On the public citation graph
Structure of Protocols for XOR Functions
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.1007/bf01263419openalex-snapshot
On the degree of boolean functions as real polynomials
inferredcites →https://doi.org/10.1007/s00037-015-0110-yopenalex-snapshot
On the Structure of Boolean Functions with Small Spectral Norm
inferredcites →https://doi.org/10.1007/s00039-010-0101-8openalex-snapshot
A Probabilistic Technique for Finding Almost-Periods of Convolutions
inferredcites →https://doi.org/10.1016/0022-0000(93)90035-uopenalex-snapshot
Communication complexity and combinatorial lattice theory
inferredcites →https://doi.org/10.1016/j.tcs.2010.03.027openalex-snapshot
On the parity complexity measures of Boolean functions
inferredcites →https://doi.org/10.1017/fms.2016.2openalex-snapshot
ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS
inferredcites →https://doi.org/10.1017/s0963548313000060openalex-snapshot
Arithmetic Progressions in Sumsets and Lp-Almost-Periodicity
inferredcites →https://doi.org/10.1137/1.9781611973402.136openalex-snapshot
Efficient quantum protocols for XOR functions
inferredcites →https://doi.org/10.1137/100785429openalex-snapshot
Testing Fourier Dimensionality and Sparsity
inferredcites →https://doi.org/10.2140/apde.2012.5.627openalex-snapshot
On the Bogolyubov–Ruzsa lemma
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-030-79416-3_28openalex-snapshot
A Generalization of a Theorem of Rothschild and van Lint
inferred← citeshttps://doi.org/10.1007/s00037-018-0175-5openalex-snapshot
Query-to-Communication Lifting for PNP
inferred← citeshttps://doi.org/10.1007/s00037-019-00190-7openalex-snapshot
Simulation Theorems via Pseudo-random Properties
inferred← citeshttps://doi.org/10.1007/s00037-024-00250-7openalex-snapshot
KRW Composition Theorems via Lifting
inferred← citeshttps://doi.org/10.1007/s11856-022-2365-8openalex-snapshot
Dimension-free bounds and structural results in communication complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113802openalex-snapshot
A generalization of a theorem of Rothschild and van Lint
inferred← citeshttps://doi.org/10.1109/focs.2017.21openalex-snapshot
Query-to-Communication Lifting for BPP
inferred← citeshttps://doi.org/10.1109/focs.2018.00014openalex-snapshot
A Short List of Equalities Induces Large Sign Rank
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00113openalex-snapshot
Nearly Optimal Communication and Query Complexity of Bipartite Matching
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00047openalex-snapshot
Fourier Growth of Communication Protocols for XOR Functions
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00059openalex-snapshot
Strong Bounds for 3-Progressions
inferred← citeshttps://doi.org/10.1134/s0032946021020046openalex-snapshot
Counting the Number of Perfect Matchings, and Generalized Decision Trees
inferred← citeshttps://doi.org/10.1137/19m1271348openalex-snapshot
A Short List of Equalities Induces Large Sign-Rank
inferred← citeshttps://doi.org/10.1137/19m1310153openalex-snapshot
Query-to-Communication Lifting Using Low-Discrepancy Gadgets
inferred← citeshttps://doi.org/10.1145/3313276.3316353openalex-snapshot
The Log-Approximate-Rank Conjecture Is False
inferred← citeshttps://doi.org/10.1145/3406325.3450999openalex-snapshot
Log-rank and lifting for AND-functions
inferred← citeshttps://doi.org/10.1145/3471469.3471478openalex-snapshot
SIGACT News Complexity Theory Column 109
inferred← citeshttps://doi.org/10.1145/3647629openalex-snapshot
On parity decision trees for Fourier-sparse Boolean functions
inferred← citeshttps://doi.org/10.25148/etd.fidc010235openalex-snapshot
A Study of Sparse Representation of Boolean Functions
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.69openalex-snapshot
Approximate F_2-Sketching of Valuation Functions
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2023.9openalex-snapshot
Fourier Growth of Parity Decision Trees
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2020.29openalex-snapshot
On Parity Decision Trees for Fourier-Sparse Boolean Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2009.02717openalex-snapshot
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.2103.16811openalex-snapshot
A Generalization of a Theorem of Rothschild and van Lint
inferred← citeshttps://doi.org/10.48550/arxiv.2107.05810openalex-snapshot
The Element Extraction Problem and the Cost of Determinism and Limited Adaptivity in Linear Queries
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.