| 2022 | The power of multiple choices in online stochastic matching. | Zhiyi Huang, Xinkai Shu, Shuyi Yan |
| 2022 | Pseudodeterminism: promises and lowerbounds. | Peter Dixon, Aduri Pavan, Jason Vander Woude, N. V. Vinodchandran |
| 2022 | Directed flow-augmentation. | Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlstrm |
| 2022 | Pricing ordered items. | Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos |
| 2022 | Flow time scheduling and prefix Beck-Fiala. | Nikhil Bansal, Lars Rohwedder, Ola Svensson |
| 2022 | Computing simple mechanisms: Lift-and-round over marginal reduced forms. | Yang Cai, Argyris Oikonomou, Mingfei Zhao |
| 2022 | A PTAS for unsplittable flow on a path. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2022 | The power of two choices in graphical allocation. | Nikhil Bansal, Ohad N. Feldheim |
| 2022 | Breaching the 2-approximation barrier for the forest augmentation problem. | Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub |
| 2021 | Succinct blind Quantum computation using a random oracle. | Jiayu Zhang |
| 2021 | A new algorithm for Euclidean shortest paths in the plane. | Haitao Wang |
| 2021 | Statistical physics of random CSPs (tutorial). | Nike Sun |
| 2021 | An optimal separation of randomized and Quantum query complexity. | Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu |
| 2021 | Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity. | Ronen Shaltiel, Jad Silbak |
| 2021 | Iterated lower bound formulas: a diagonalization-based approach to proof complexity. | Rahul Santhanam, Iddo Tzameret |
| 2021 | The randomized communication complexity of randomized auctions. | Aviad Rubinstein, Junyao Zhao |
| 2021 | Exponential communication separations between notions of selfishness. | Aviad Rubinstein, Raghuvansh R. Saxena, Clayton Thomas, S. Matthew Weinberg, Junyao Zhao |
| 2021 | Stronger bounds for weak epsilon-nets in higher dimensions. | Natan Rubin |
| 2021 | Linear bandits with limited adaptivity and learning distributional optimal design. | Yufei Ruan, Jiaqi Yang, Yuan Zhou |
| 2021 | A (2 + | Lars Rohwedder, Andreas Wiese |
| 2021 | Automating algebraic proof systems is NP-hard. | Susanna F. de Rezende, Mika Gs, Jakob Nordstrm, Toniann Pitassi, Robert Robere, Dmitry Sokolov |
| 2021 | Stronger calibration lower bounds via sidestepping. | Mingda Qiao, Gregory Valiant |
| 2021 | Strong co-nondeterministic lower bounds for NP cannot be proved feasibly. | Jn Pich, Rahul Santhanam |
| 2021 | Information theoretic limits of cardinality estimation: Fisher meets Shannon. | Seth Pettie, Dingyu Wang |
| 2021 | Frozen 1-RSB structure of the symmetric Ising perceptron. | Will Perkins, Changji Xu |