We present improved decoding algorithms for expander-based Tanner codes.
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
Expansion of Ramanujan Graph 组会讲稿(旧)