Joshua Brakensiek
Cited by
Cited by
Efficient low-redundancy codes for correcting multiple deletions
J Brakensiek, V Guruswami, S Zbarsky
IEEE Transactions on Information Theory 64 (5), 3403-3410, 2017
Promise constraint satisfaction: Algebraic structure and a symmetric boolean dichotomy
J Brakensiek, V Guruswami
arXiv preprint arXiv:1704.01937, 2017
Efficient Geometric Probabilities of Multi-Transiting Exoplanetary Systems from CORBITS
J Brakensiek, D Ragozzine
The Astrophysical Journal 821 (1), 47, 2016
New hardness results for graph and hypergraph colorings
J Brakensiek, V Guruswami
31st Conference on Computational Complexity (CCC 2016), 2016
An algorithmic blend of LPs and ring equations for promise CSPs
J Brakensiek, V Guruswami
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
The quest for strong inapproximability results with perfect completeness
J Brakensiek, V Guruswami
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017
Constant-factor approximation of near-linear edit distance in near-linear time
J Brakensiek, A Rubinstein
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
Symmetric polymorphisms and efficient decidability of promise CSPs
J Brakensiek, V Guruswami
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
Coded trace reconstruction in a constant number of traces
J Brakensiek, R Li, B Spang
arXiv preprint arXiv:1908.03996, 2019
The resolution of Keller’s conjecture
J Brakensiek, M Heule, J Mackey, D Narváez
International Joint Conference on Automated Reasoning, 48-65, 2020
A Simple Sublinear Algorithm for Gap Edit Distance
J Brakensiek, M Charikar, A Rubinstein
arXiv preprint arXiv:2007.14368, 2020
The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs
J Brakensiek, V Guruswami, M Wrochna, S Živný
arXiv, arXiv: 1907.04383, 2019
Bridging between 0/1 and linear programming via random walks
J Brakensiek, V Guruswami
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
CSPs with global modular constraints: algorithms and hardness via polynomial representations
J Brakensiek, S Gopi, V Guruswami
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Vertex isoperimetry and independent set stability for tensor powers of cliques
J Brakensiek
arXiv preprint arXiv:1702.04432, 2017
Bounds on the size of sound monotone switching networks accepting permutation sets of directed trees
J Brakensiek, A Potechin
arXiv preprint arXiv:1301.3780, 2013
On the Mysteries of MAX NAE-SAT
J Brakensiek, N Huang, A Potechin, U Zwick
arXiv preprint arXiv:2009.10677, 2020
Smoothed Complexity of 2-player Nash Equilibria
S Boodaghians, J Brakensiek, SB Hopkins, A Rubinstein
arXiv preprint arXiv:2007.10857, 2020
A Family of Dictatorship Tests with Perfect Completeness for 2-to-2 Label Cover.
J Brakensiek, V Guruswami
Electronic Colloquium on Computational Complexity (ECCC) 24, 141, 2017
The system can't perform the operation now. Try again later.
Articles 1–19