On the public citation graph

A Strong Parallel Repetition Theorem for Projection Games on Expanders

0 signed · 32 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/bf02579166openalex-snapshot
Eigenvalues and expanders
inferredcites →https://doi.org/10.1007/s00493-002-0001-0openalex-snapshot
Error Reduction by Parallel Repetition—A Negative Result
inferredcites →https://doi.org/10.1016/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0743744-xopenalex-snapshot
Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
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.2004.1313847openalex-snapshot
Consequences and limits of nonlocal strategies
inferredcites →https://doi.org/10.1109/ccc.2010.20openalex-snapshot
Spectral Algorithms for Unique Games
inferredcites →https://doi.org/10.1109/focs.2008.49openalex-snapshot
A Counterexample to Strong Parallel Repetition
inferredcites →https://doi.org/10.1109/focs.2008.55openalex-snapshot
Rounding Parallel Repetitions of Unique Games
inferredcites →https://doi.org/10.1137/080734042openalex-snapshot
Parallel Repetition in Projection Games and a Concentration Bound
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1137/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferredcites →https://doi.org/10.1145/129712.129783openalex-snapshot
Two-prover one-round proof systems
inferredcites →https://doi.org/10.1145/1374376.1374380openalex-snapshot
Unique games on expanding constraint graphs are easy
inferredcites →https://doi.org/10.1145/1806689.1806701openalex-snapshot
How to compress interactive communication
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/258533.258620openalex-snapshot
Direct product results and the GCD problem, in old and new communication models
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.4086/toc.2009.v005a008openalex-snapshot

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-662-43948-7_83openalex-snapshot
Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs
inferred← citeshttps://doi.org/10.1007/s00037-015-0098-3openalex-snapshot
A parallel repetition theorem for entangled projection games
inferred← citeshttps://doi.org/10.1109/ccc.2014.28openalex-snapshot
A Parallel Repetition Theorem for Entangled Projection Games
inferred← citeshttps://doi.org/10.1109/ccc.2014.29openalex-snapshot
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions
inferred← citeshttps://doi.org/10.1109/focs.2014.51openalex-snapshot
Parallel Repetition from Fortification
inferred← citeshttps://doi.org/10.1145/1993636.1993684openalex-snapshot
Parallel repetition of entangled games
inferred← citeshttps://doi.org/10.1145/2591796.2591884openalex-snapshot
Analytical approach to parallel repetition
inferred← citeshttps://doi.org/10.1145/2746539.2746565openalex-snapshot
Small Value Parallel Repetition for General Games
inferred← citeshttps://doi.org/10.1145/3519935.3520071openalex-snapshot
Parallel repetition for all 3-player games over binary alphabet
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.48550/arxiv.1012.4728openalex-snapshot
Parallel Repetition of Entangled Games
inferred← citeshttps://doi.org/10.48550/arxiv.1310.4113openalex-snapshot
A parallel repetition theorem for entangled projection games
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08743openalex-snapshot
Strong Parallel Repetition for Unique Games on Small Set Expanders
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.