Reasonable Bounds for Combinatorial Lines of Length Three [arXiv]
On Approximability of Satisfiable k-CSPs: VII [arXiv]
On Approximability of Satisfiable k-CSPs: VI [arXiv]
On Approximability of Satisfiable k-CSPs: V [eccc]
Parallel Repetition for 3-XOR Games [arXiv]
Parallel Repetition of k-Player Projection Games [eccc]
Effective Bounds for Restricted 3-Arithmetic Progressions in F_p^n [eccc]
On Approximability of Satisfiable k-CSPs: IV [eccc]
On Approximability of Satisfiable k-CSPs: III [eccc]
On Approximability of Satisfiable k-CSPs: II [eccc]
Efficient Adaptively-Secure Byzantine Agreement for Long Messages [ePrint]
A Toolbox for Barriers on Interactive Oracle Proofs [ePrint]
On Approximability of Satisfiable k-CSPs: I [eccc]
Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs. [arxiv]
Mixing of 3-term progressions in Quasirandom Groups. [eccc]
Optimal Inapproximability of Satisfiable k-LIN over Non-Abelian Groups. [eccc]
Rigid Matrices From Rectangular PCPs. [eccc]
Hardness of Approximation of (Multi-)LCS over Small Alphabet. [arxiv]
Simultaneous Max-Cut is harder to approximate than Max-Cut. [eccc]
Simplified inapproximability of hypergraph coloring via t-agreeing families. [eccc]
Improved Inapproximability of Rainbow Coloring. [arxiv]
UG-hardness to NP-hardness by Losing Half. [eccc]
NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors. [eccc]
A short note on the joint entropy of n/2-wise independence. [arxiv]
Near-optimal approximation algorithm for simultaneous Max-Cut. [arxiv]
An Improved Dictatorship Test with Perfect Completeness. [eccc]
Cube vs Cube Low Degree Test. [eccc]
Bicovering: Covering edges with two small subsets of vertices. [eccc]
On Fortification of Projection Games. [eccc]
A Characterization of hard-to-cover CSPs. [arxiv]
Simultaneous approximation of constraint satisfaction problems. [arxiv]
The complexity of computing the minimum rank of a sign pattern matrix. [arxiv]