😋

Blog-E

路漫漫其修远兮，吾将上下而求索。

算法

ISIT会议报告(Improved Decoding of Tanner Codes)

We present improved decoding algorithms for expander-based Tanner codes.

算法

组会分享(LDC Lower Bound)

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation

算法

【题解】USTCPC25 F&K题解

出的两道妙妙题

算法

论文笔记(Dynamic Tree Cut Sparsifier)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality

算法

组会分享(Expansion of Ramanujan Graph)

Expansion of Ramanujan Graph 组会讲稿（旧）