| 2020 | Faster Dynamic Range Mode. | Bryce Sandlund, Yinzhan Xu |
| 2020 | Hardness Results for Constant-Free Pattern Languages and Word Equations. | Aleksi Saarela |
| 2020 | The Power of a Single Qubit: Two-Way Quantum Finite Automata and the Word Problem. | Zachary Remscrim |
| 2020 | A Spectral Bound on Hypergraph Discrepancy. | Aditya Potukuchi |
| 2020 | Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. | Toniann Pitassi, Morgan Shirley, Thomas Watson |
| 2020 | On Skolem-Hardness and Saturation Points in Markov Decision Processes. | Jakob Piribauer, Christel Baier |
| 2020 | Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata. | Erik Paul |
| 2020 | Network-Aware Strategies in Financial Systems. | Pl Andrs Papp, Roger Wattenhofer |
| 2020 | A General Stabilization Bound for Influence Propagation in Graphs. | Pl Andrs Papp, Roger Wattenhofer |
| 2020 | On Solving (Non)commutative Weighted Edmonds' Problem. | Taihei Oki |
| 2020 | Computing Measures of Weak-MSO Definable Sets of Trees. | Damian Niwinski, Marcin Przybylko, Michal Skrzypczak |
| 2020 | Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic. | L Thnh Dung Nguyn, Ccilia Pradic |
| 2020 | Hypergraph Isomorphism for Groups with Restricted Composition Factors. | Daniel Neuen |
| 2020 | On the Complexity of Zero Gap MIP. | Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen |
| 2020 | Breaking the Barrier of 2 for the Storage Allocation Problem. | Tobias Mmke, Andreas Wiese |
| 2020 | Proportionally Fair Clustering Revisited. | Evi Micha, Nisarg Shah |
| 2020 | On the Two-Dimensional Knapsack Problem for Convex Polygons. | Arturo Merino, Andreas Wiese |
| 2020 | When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic? | Sebastian Maneth, Helmut Seidl |
| 2020 | On Decidability of Time-Bounded Reachability in CTMDPs. | Rupak Majumdar, Mahmoud Salamati, Sadegh Soudjani |
| 2020 | Can Verifiable Delay Functions Be Based on Random Oracles? | Mohammad Mahmoody, Caleb Smith, David J. Wu |
| 2020 | Quantum Distributed Complexity of Set Disjointness on a Line. | Frdric Magniez, Ashwin Nayak |
| 2020 | A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2020 | Succinct Filters for Sets of Unknown Sizes. | Mingmou Liu, Yitong Yin, Huacheng Yu |
| 2020 | Faster Random k-CNF Satisfiability. | Andrea Lincoln, Adam Yedidia |
| 2020 | Polytopes, Lattices, and Spherical Codes for the Nearest Neighbor Problem. | Thijs Laarhoven |