| Year | Title | Author | Venue |
|---|---|---|---|
| 2021 | Online Stochastic Matching with Edge Arrivals | Nick Gravin, Zhihao Gavin Tang, Kangning Wang | ICALP 2021 |
| 2021 | Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications | Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang | ICALP 2021 |
| 2021 | Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem | Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang | COLT 2021 |
| 2021 | Tight Revenue Gaps among Multi-Unit Mechanisms | Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang | EC 2021 |
| 2021 | An Algorithmic Framework for Approximating Maximin Share Allocation of Chores | Xin Huang, Pinyan Lu | EC 2021 |
| 2021 | Online Selection Problems against Constrained Adversary | Zhihao Jiang, Pinyan Lu, Zhihao Gavin Tang, Yuhao Zhang | ICML 2021 |
| 2021 | Zeros of Holant Problems: Locations and Algorithms | Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang | ACM Trans. Algorithms |
| 2021 | Vertex Sparsification for Edge Connectivity | Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz | SODA 2021 |
| 2021 | Concentration bounds for almost k-wise independence with applications to non-uniform security | Nick Gravin, Siyao Guo, Tsz Chiu Kwok, Pinyan Lu | SODA 2021 |
| 2021 | Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler | Zhengfeng Ji, Zhihan Jin, Pinyan Lu | SODA 2021 |
| 2021 | Generalized Sorting with Predictions | Pinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang | SOSA 2021 |
