Joshua Brakensiek
Scholar

Joshua Brakensiek

Google Scholar ID: 2DVxEqsAAAAJ
University of California, Berkeley
theoretical computer scienceconstraint satisfaction problemsapproximation algorithmshardness
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
869
 
H-index
16
 
i10-index
21
 
Publications
20
 
Co-authors
30
list available
Contact
No contact links provided.
Publications
14 items
Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
2026
Cited
0
Classification of Non-redundancy of Boolean Predicates of Arity 4
2026
Cited
0
Maximal Recoverability: A Nexus of Coding Theory
2026
Cited
0
New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
2026
Cited
0
MAX BISECTION might be harder to approximate than MAX CUT
2025
Cited
0
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
2025
Cited
1
Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
2025
Cited
1
Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
2025
Cited
0
Resume (English only)
Co-authors
30 total
Venkatesan Guruswami
Venkatesan Guruswami
University of California, Berkeley
Sivakanth Gopi
Sivakanth Gopi
Microsoft Research
Co-author 3
Co-author 3
Co-author 4
Co-author 4
Aviad Rubinstein
Aviad Rubinstein
Stanford University
Uri Zwick
Uri Zwick
Tel Aviv University
Co-author 7
Co-author 7
Co-author 8
Co-author 8