Scholar
Joshua Brakensiek
Google Scholar ID: 2DVxEqsAAAAJ
University of California, Berkeley
theoretical computer science
constraint satisfaction problems
approximation algorithms
hardness
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
869
H-index
16
i10-index
21
Publications
20
Co-authors
30
list available
Publications
22 items
Cores Characterize the One-Pass Streaming Complexity of CSPs
2026
Cited
0
The Reach of Abelian Covers in Hypergraphs
2026
Cited
0
Separating Non-redundancy and Chain Length
2026
Cited
0
Algorithmic List Decoding of Reed-Solomon Codes up to Capacity
2026
Cited
1
Bounds and Limitations on Codes Achieving List Recovery Capacity
2026
Cited
0
Quantum Cut Sparsifiers
2026
Cited
0
Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
2026
Cited
0
Many Hamiltonians Are Sparsifiable
2026
Cited
0
Load more
Co-authors
10 total
Venkatesan Guruswami
University of California, Berkeley
Sivakanth Gopi
Microsoft Research
Aviad Rubinstein
Stanford University
Uri Zwick
Tel Aviv University
Marijn Heule
Associate Professor of Computer Science, Carnegie Mellon University
Stanislav Živný
Professor of Computer Science, University of Oxford
Marcin Wrochna
Institute of Informatics, University of Warsaw
Ray Li
UC Berkeley
