| 2021 | An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D. | Pankaj K. Agarwal, Alex Steiger |
| 2021 | Dynamic Enumeration of Similarity Joins. | Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, Jun Yang |
| 2021 | Almost-Linear-Time Weighted 𝓁 | Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva |
| 2021 | Local Approximations of the Independent Set Polynomial. | Dimitris Achlioptas, Kostas Zampetakis |
| 2021 | Arboreal Categories and Resources. | Samson Abramsky, Luca Reggio |
| 2021 | Fine-Grained Hardness for Edit Distance to a Fixed Sequence. | Amir Abboud, Virginia Vassilevska Williams |
| 2021 | LF Successor: Compact Space Indexing for Order-Isomorphic Pattern Matching. | Arnab Ganguly, Dhrumil Patel, Rahul Shah, Sharma V. Thankachan |
| 2021 | Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces. | Alexandre Goy, Daniela Petrisan, Marc Aiguier |
| 2021 | Knapsack and Subset Sum with Small Items. | Adam Polak, Lars Rohwedder, Karol Wegrzycki |
| 2021 | Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC¹. | Lijie Chen, Zhenjian Lu, Xin Lyu, Igor C. Oliveira |
| 2021 | Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. | Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu |
| 2021 | Truthful Allocation in Graphs and Hypergraphs. | George Christodoulou, Elias Koutsoupias, Annamria Kovcs |
| 2021 | Uniform Elgot Iteration in Foundations. | Sergey Goncharov |
| 2021 | A Spectral Independence View on Hard Spheres via Block Dynamics. | Tobias Friedrich, Andreas Gbel, Martin S. Krejca, Marcus Pappik |
| 2021 | Sorting Short Integers. | Michal Kouck, Karel Krl |
| 2020 | An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk). | Andrew Chi-Chih Yao |
| 2020 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2020 | Near-Optimal Algorithm for Constructing Greedy Consensus Tree. | Hongxun Wu |
| 2020 | Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth. | Daniel Wiebking |
| 2020 | Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis. | Armin Wei |
| 2020 | On Quasipolynomial Multicut-Mimicking Networks and Kernelization of Multiway Cut Problems. | Magnus Wahlstrm |
| 2020 | Lower Bounds for Dynamic Distributed Task Allocation. | Hsin-Hao Su, Nicole Wein |
| 2020 | On the Degree of Boolean Functions as Polynomials over ℤ | Xiaoming Sun, Yuan Sun, Jiaheng Wang, Kewen Wu, Zhiyu Xia, Yufan Zheng |
| 2020 | Quasi-Majority Functional Voting on Expander Graphs. | Nobutaka Shimizu, Takeharu Shiraga |
| 2020 | An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes. | Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos |