2017/04/13 On the Optimality of Tape Merge (Xiaoming Sun)

2017/03/28 Local max-cut in smoothed polynomial time (Fan Wei）

2017/02/22 Approximating Survivable Network Design via Rounding-by-Tree-Embedding (Bundit Laekhanukit)

2017/02/20 Constrained Counting and Sampling: Bridging the Gap between Theory and Practice (Kuldeep Meel)

2017/01/12 How to find relations between two networks? (Yangjing Long)

2017/01/10 Computing minimum cuts in hypergraphs (Chao Xu)

2017/01/05 Distributed matrix sketching (Zengfeng Huang)

2016/12/21 Some Recent Progress on Quantum Information Complexity (Penghui Yao)

2016/12/21 Uniform Sampling through the Lovász Local Lemma (Heng Guo)

2016/12/21 On the Complexity of Coalitional Stability in Two-Sided Markets with Budget Constraints (Anisse Ismaili)