| 2021 | Load balancing with dynamic set of balls and bins. | Anders Aamand, Jakob Bk Tejs Knudsen, Mikkel Thorup |
| 2021 | The metric relaxation for | Roy Schwartz, Nitzan Tur |
| 2021 | A deterministic algorithm for the MST problem in constant rounds of congested clique. | Krzysztof Nowicki |
| 2021 | Efficient and near-optimal algorithms for sampling connected subgraphs. | Marco Bressan |
| 2021 | Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. | Lijie Chen, Roei Tell |
| 2021 | A new analysis of differential privacy's generalization guarantees (invited paper). | Christopher Jung, Katrina Ligett, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi, Moshe Shenfeld |
| 2021 | Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemma. | Lijie Chen, Xin Lyu |
| 2021 | Almost optimal super-constant-pass streaming lower bounds for reachability. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2021 | Near-optimal learning of tree-structured distributions by Chow-Liu. | Arnab Bhattacharyya, Sutanu Gayen, Eric Price, N. V. Vinodchandran |
| 2021 | Separating words and trace reconstruction. | Zachary Chase |
| 2020 | QCSP monsters and the demise of the chen conjecture. | Dmitriy Zhuk, Barnaby Martin |
| 2020 | Nearly optimal static Las Vegas succinct dictionary. | Huacheng Yu |
| 2020 | Rounding dynamic matchings against an adaptive adversary. | David Wajc |
| 2020 | Reducing path TSP to TSP. | Vera Traub, Jens Vygen, Rico Zenklusen |
| 2020 | An improved approximation algorithm for ATSP. | Vera Traub, Jens Vygen |
| 2020 | Towards a better understanding of randomized greedy matching. | Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang |
| 2020 | Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius. | Chong Shangguan, Itzhak Tamo |
| 2020 | Near-optimal fully dynamic densest subgraph. | Saurabh Sawlani, Junxing Wang |
| 2020 | Polylogarithmic-time deterministic network decomposition and distributed derandomization. | Vclav Rozhon, Mohsen Ghaffari |
| 2020 | How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable. | Cristobal Rojas, Michael Yampolsky |
| 2020 | Fooling Gaussian PTFs via local hyperconcentration. | Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan |
| 2020 | Detecting and counting small patterns in planar graphs in subexponential parameterized time. | Jesper Nederlof |
| 2020 | Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication. | Jesper Nederlof |
| 2020 | Weighted min-cut: sequential, cut-query, and streaming algorithms. | Sagnik Mukhopadhyay, Danupon Nanongkai |
| 2020 | Lifting sum-of-squares lower bounds: degree-2 to degree-4. | Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu |