Sledovat
Joshua Brakensiek
Název
Citace
Citace
Rok
Efficient low-redundancy codes for correcting multiple deletions
J Brakensiek, V Guruswami, S Zbarsky
IEEE Transactions on Information Theory 64 (5), 3403-3410, 2017
1212017
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy
J Brakensiek, V Guruswami
SIAM Journal on Computing 50 (6), 1663-1700, 2021
54*2021
Efficient geometric probabilities of multi-transiting exoplanetary systems from corbits
J Brakensiek, D Ragozzine
The Astrophysical Journal 821 (1), 47, 2016
432016
New hardness results for graph and hypergraph colorings
J Brakensiek, V Guruswami
31st Conference on Computational Complexity (CCC 2016), 2016
402016
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
312020
Coded trace reconstruction in a constant number of traces
J Brakensiek, R Li, B Spang
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
262020
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
212019
The resolution of Keller’s conjecture
J Brakensiek, M Heule, J Mackey, D Narváez
Journal of Automated Reasoning, 1-24, 2022
192022
The quest for strong inapproximability results with perfect completeness
J Brakensiek, V Guruswami
ACM Transactions on Algorithms (TALG) 17 (3), 1-35, 2021
17*2021
The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems
J Brakensiek, V Guruswami, M Wrochna, S Zivny
SIAM Journal on Computing 49 (6), 1232-1248, 2020
132020
Symmetric polymorphisms and efficient decidability of promise CSPs
J Brakensiek, V Guruswami
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
122020
A simple sublinear algorithm for gap edit distance
J Brakensiek, M Charikar, A Rubinstein
arXiv preprint arXiv:2007.14368, 2020
72020
Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy.
J Brakensiek, V Guruswami
Electron. Colloquium Comput. Complex. 23, 183, 2016
62016
Conditional dichotomy of boolean ordered promise csps
J Brakensiek, V Guruswami, S Sandeep
arXiv preprint arXiv:2102.11854, 2021
52021
The Resolution of Keller's Conjecture
J Brakensiek, M Heule, J Mackey, D Narváez
arXiv preprint arXiv:1910.03740, 2019
42019
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
42019
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
42019
Smoothed complexity of 2-player nash equilibria
S Boodaghians, J Brakensiek, SB Hopkins, A Rubinstein
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
22020
Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes
J Brakensiek, S Gopi, V Makam
arXiv preprint arXiv:2107.10822, 2021
12021
On the mysteries of MAX NAE-SAT
J Brakensiek, N Huang, A Potechin, U Zwick
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
12021
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20