Seguir
Joshua Brakensiek
Título
Citado por
Citado por
Año
Efficient low-redundancy codes for correcting multiple deletions
J Brakensiek, V Guruswami, S Zbarsky
IEEE Transactions on Information Theory 64 (5), 3403-3410, 2017
1742017
Promise constraint satisfaction: Algebraic structure and a symmetric boolean dichotomy
J Brakensiek, V Guruswami
SIAM Journal on Computing 50 (6), 1663-1700, 2021
98*2021
The resolution of Keller’s conjecture
J Brakensiek, M Heule, J Mackey, D Narváez
Journal of Automated Reasoning 66 (3), 277-300, 2022
592022
New hardness results for graph and hypergraph colorings
J Brakensiek, V Guruswami
31st Conference on Computational Complexity (CCC 2016), 2016
572016
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
532020
Efficient geometric probabilities of multi-transiting exoplanetary systems from corbits
J Brakensiek, D Ragozzine
The Astrophysical Journal 821 (1), 47, 2016
502016
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
412020
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
392020
Generic reed-solomon codes achieve list-decoding capacity
J Brakensiek, S Gopi, V Makam
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1488-1501, 2023
362023
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
362019
The quest for strong inapproximability results with perfect completeness
J Brakensiek, V Guruswami
ACM Transactions on Algorithms (TALG) 17 (3), 1-35, 2021
22*2021
Conditional Dichotomy of Boolean Ordered Promise CSPs
J Brakensiek, V Guruswami, S Sandeep
TheoretiCS 2, 2023
212023
Lower bounds for maximally recoverable tensor codes and higher order MDS codes
J Brakensiek, S Gopi, V Makam
IEEE Transactions on Information Theory 68 (11), 7125-7140, 2022
172022
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
172020
Symmetric polymorphisms and efficient decidability of promise CSPs
J Brakensiek, V Guruswami
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
152020
Improved field size bounds for higher order MDS codes
J Brakensiek, M Dhar, S Gopi
IEEE Transactions on Information Theory, 2024
132024
A simple sublinear algorithm for gap edit distance
J Brakensiek, M Charikar, A Rubinstein
arXiv preprint arXiv:2007.14368, 2020
112020
AG codes achieve list decoding capacity over constant-sized fields
J Brakensiek, M Dhar, S Gopi, Z Zhang
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 740-751, 2024
102024
SDPs and robust satisfiability of promise CSP
J Brakensiek, V Guruswami, S Sandeep
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 609-622, 2023
102023
Separating max 2-and, max di-cut and max cut
J Brakensiek, N Huang, A Potechin, U Zwick
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
92023
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20