On the public citation graph

Understanding Parallel Repetition Requires Understanding Foams

0 signed · 81 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11682462_22openalex-snapshot
Eliminating Cycles in the Discrete Torus
inferredcites →https://doi.org/10.1007/bf01844850openalex-snapshot
How much are increasing sets positively correlated?
inferredcites →https://doi.org/10.1007/bf02418046openalex-snapshot
On the division of space with minimum partitional area
inferredcites →https://doi.org/10.1007/bf02773611openalex-snapshot
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
inferredcites →https://doi.org/10.1007/s00037-006-0210-9openalex-snapshot
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
inferredcites →https://doi.org/10.1007/s00037-008-0250-4openalex-snapshot
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
inferredcites →https://doi.org/10.1007/s004540010071openalex-snapshot
The Honeycomb Conjecture
inferredcites →https://doi.org/10.1007/s00493-002-0001-0openalex-snapshot
Error Reduction by Parallel Repetition—A Negative Result
inferredcites →https://doi.org/10.1007/s00493-004-0031-xopenalex-snapshot
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks
inferredcites →https://doi.org/10.1016/j.ejc.2005.05.001openalex-snapshot
Sphere packings revisited
inferredcites →https://doi.org/10.1080/09500830701698298openalex-snapshot
LXIII. On the division of space with minimum partitional area
inferredcites →https://doi.org/10.1080/09500839408241577openalex-snapshot
A counter-example to Kelvin's conjecture on minimal surfaces
inferredcites →https://doi.org/10.1098/rspa.2003.1171openalex-snapshot
Pressures in periodic foams
inferredcites →https://doi.org/10.1103/physreva.66.042111openalex-snapshot
Quantum nonlocality, Bell inequalities, and the memory loophole
inferredcites →https://doi.org/10.1109/ccc.2002.1004334openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1109/ccc.2003.1214437openalex-snapshot
Vertex cover might be hard to approximate to within 2-ε
inferredcites →https://doi.org/10.1109/ccc.2005.20openalex-snapshot
On the Hardness of Approximating Multicut and Sparsest-Cut
inferredcites →https://doi.org/10.1109/focs.2004.49openalex-snapshot
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
inferredcites →https://doi.org/10.1109/focs.2006.67openalex-snapshot
SDP gaps and UGC-hardness for MAXCUTGAIN
inferredcites →https://doi.org/10.1109/istcs.1995.377033openalex-snapshot
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
inferredcites →https://doi.org/10.1109/sct.1991.160251openalex-snapshot
On the success probability of the two provers in one-round proof systems
inferredcites →https://doi.org/10.1109/sfcs.2005.74openalex-snapshot
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1137/s0097539797325375openalex-snapshot
Two-Prover Protocols---Low Error at Affordable Rates
inferredcites →https://doi.org/10.1137/s0097539797328847openalex-snapshot
Gadgets, Approximation, and Linear Programming
inferredcites →https://doi.org/10.1142/s0129167x9600044xopenalex-snapshot
OPEN PROBLEMS IN SOAP BUBBLE GEOMETRY
inferredcites →https://doi.org/10.1145/1132516.1132519openalex-snapshot
Gowers uniformity, influence of variables, and PCPs
inferredcites →https://doi.org/10.1145/1132516.1132567openalex-snapshot
Conditional hardness for approximate coloring
inferredcites →https://doi.org/10.1145/1250790.1250852openalex-snapshot
Parallel repetition
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1145/62212.62223openalex-snapshot
Multi-prover interactive proofs: how to remove intractability
inferredcites →https://doi.org/10.4007/annals.2010.171.295openalex-snapshot
Noise stability of functions with low influences: Invariance and optimality
inferredcites →https://doi.org/10.4310/jdg/1214443065openalex-snapshot
On the existence and regularity of fundamental domains with least boundary area
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0608146openalex-snapshot
Strong Parallel Repetition Theorem for Quantum XOR Proof Systems

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-540-78773-0_58openalex-snapshot
Parallel Repetition of the Odd Cycle Game
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_27openalex-snapshot
Strong Parallel Repetition Theorem for Free Projection Games
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_54openalex-snapshot
Improved Rounding for Parallel Repeated Unique Games
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_83openalex-snapshot
Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs
inferred← citeshttps://doi.org/10.1007/s00037-008-0250-4openalex-snapshot
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
inferred← citeshttps://doi.org/10.1098/rspa.2008.0149openalex-snapshot
Monogamy of non-local quantum correlations
inferred← citeshttps://doi.org/10.1103/physrevlett.129.230403openalex-snapshot
Exponentially Decreasing Critical Detection Efficiency for Any Bell Inequality
inferred← citeshttps://doi.org/10.1109/ccc.2007.24openalex-snapshot
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
inferred← citeshttps://doi.org/10.1109/ccc.2010.10openalex-snapshot
No Strong Parallel Repetition with Entangled and Non-signaling Provers
inferred← citeshttps://doi.org/10.1109/ccc.2010.19openalex-snapshot
On the Unique Games Conjecture (Invited Survey)
inferred← citeshttps://doi.org/10.1109/ccc.2010.9openalex-snapshot
Parallel Repetition of Two Prover Games (Invited Survey)
inferred← citeshttps://doi.org/10.1109/focs.2008.33openalex-snapshot
Approximate Kernel Clustering
inferred← citeshttps://doi.org/10.1109/focs.2008.49openalex-snapshot
A Counterexample to Strong Parallel Repetition
inferred← citeshttps://doi.org/10.1109/focs.2008.50openalex-snapshot
Spherical Cubes and Rounding in High Dimensions
inferred← citeshttps://doi.org/10.1109/focs.2008.55openalex-snapshot
Rounding Parallel Repetitions of Unique Games
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00060openalex-snapshot
Chernoff Bounds and Reverse Hypercontractivity on HDX
inferred← citeshttps://doi.org/10.1112/mtk.70070openalex-snapshot
Approximate isoperimetry for convex polytopes
inferred← citeshttps://doi.org/10.1137/1.9781611973402.119openalex-snapshot
Hypercontractive inequalities via SOS, and the Frankl–Rödl graph
inferred← citeshttps://doi.org/10.1142/s1793525309000096openalex-snapshot
ECONOMICAL TORIC SPINES VIA CHEEGER'S INEQUALITY
inferred← citeshttps://doi.org/10.1145/1250790.1250852openalex-snapshot
Parallel repetition
inferred← citeshttps://doi.org/10.1145/1536414.1536435openalex-snapshot
New direct-product testers and 2-query PCPs
inferred← citeshttps://doi.org/10.1145/1806689.1806792openalex-snapshot
Graph expansion and the unique games conjecture
inferred← citeshttps://doi.org/10.1145/1993636.1993684openalex-snapshot
Parallel repetition of entangled games
inferred← citeshttps://doi.org/10.1145/2347736.2347757openalex-snapshot
Spherical cubes
inferred← citeshttps://doi.org/10.1145/2591796.2591884openalex-snapshot
Analytical approach to parallel repetition
inferred← citeshttps://doi.org/10.1145/3519935.3520071openalex-snapshot
Parallel repetition for all 3-player games over binary alphabet
inferred← citeshttps://doi.org/10.1145/3717823.3718190openalex-snapshot
Parallel Repetition for 3-Player 𝘟𝘖𝘙 Games
inferred← citeshttps://doi.org/10.19086/da.612openalex-snapshot
Hypercontractive inequalities via SOS, and the Frankl--Rödl graph
inferred← citeshttps://doi.org/10.4036/iis.2015.l.01openalex-snapshot
Parallel Repetition of Two-Prover One-Round Games: An Exposition
inferred← citeshttps://doi.org/10.4086/toc.2009.v005a008openalex-snapshot
inferred← citeshttps://doi.org/10.4171/icm2022/190openalex-snapshot
Interactions of computational complexity theory and mathematics
inferred← citeshttps://doi.org/10.4230/dagsemproc.07411.6openalex-snapshot
The Unique Games Conjecture with Entangled Provers is False
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2014.433openalex-snapshot
Parity is Positively Useless
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2021.5openalex-snapshot
Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies
inferred← citeshttps://doi.org/10.4310/cdm.2019.v2019.n1.a2openalex-snapshot
On the proof of the 2-to-2 Games Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.0807.4626openalex-snapshot
Approximate kernel clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1004.2882openalex-snapshot
The communication complexity of XOR games via summing operators
inferred← citeshttps://doi.org/10.48550/arxiv.1012.4728openalex-snapshot
Parallel Repetition of Entangled Games
inferred← citeshttps://doi.org/10.48550/arxiv.1603.05349openalex-snapshot
Parallel repetition via fortification: analytic view and the quantum case
inferred← citeshttps://doi.org/10.48550/arxiv.2107.06156openalex-snapshot
Parallel Repetition for the GHZ Game: A Simpler Proof
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0608146openalex-snapshot
Strong Parallel Repetition Theorem for Quantum XOR Proof Systems
inferred← citeshttps://doi.org/10.5555/2634074.2634193openalex-snapshot
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph
inferred← citeshttps://doi.org/10.71781/9824openalex-snapshot
Multi-Prover and parallel repetition in non-classical interactive games
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.