| 2020 | Cryptographic Reverse Firewalls for Interactive Proof Systems. | Chaya Ganesh, Bernardo Magri, Daniele Venturi |
| 2020 | Counting Solutions to Random CNF Formulas. | Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang |
| 2020 | The Complexity of Verifying Loop-Free Programs as Differentially Private. | Marco Gaboardi, Kobbi Nissim, David Purser |
| 2020 | Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. | Martin Frer, Carlos Hoppen, Vilmar Trevisan |
| 2020 | The Topology of Local Computing in Networks. | Pierre Fraigniaud, Ami Paz |
| 2020 | Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. | Dimitris Fotakis, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis |
| 2020 | The Online Min-Sum Set Cover Problem. | Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos, Stratis Skoulakis, Manolis Vardas |
| 2020 | Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. | Fedor V. Fomin, Daniel Lokshtanov, Ivan Mihajlin, Saket Saurabh, Meirav Zehavi |
| 2020 | Approximate Nearest Neighbor for Curves - Simple, Efficient, and Deterministic. | Arnold Filtser, Omrit Filtser, Matthew J. Katz |
| 2020 | Scattering and Sparse Partitions, and Their Applications. | Arnold Filtser |
| 2020 | The Adversarial Stackelberg Value in Quantitative Games. | Emmanuel Filiot, Raffaella Gentilini, Jean-Franois Raskin |
| 2020 | The Complexity of Knapsack Problems in Wreath Products. | Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche |
| 2020 | A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems. | Andrs Fielbaum, Ignacio Morales, Jos Verschae |
| 2020 | Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time. | Hendrik Fichtenberger, Mingze Gao, Pan Peng |
| 2020 | How to Hide a Clique? | Uriel Feige, Vadim Grinberg |
| 2020 | Property Testing of LP-Type Problems. | Rogers Epstein, Sandeep Silwal |
| 2020 | Extending Partial 1-Planar Drawings. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2020 | The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem. | Shaddin Dughmi |
| 2020 | A Scaling Algorithm for Weighted f-Factors in General Graphs. | Ran Duan, Haoqing He, Tianyi Zhang |
| 2020 | Hard Problems on Random Graphs. | Jan Dreier, Henri Lotze, Peter Rossmanith |
| 2020 | Spectral Sparsification via Bounded-Independence Sampling. | Dean Doron, Jack Murtagh, Salil P. Vadhan, David Zuckerman |
| 2020 | From Linear to Additive Cellular Automata. | Alberto Dennunzio, Enrico Formenti, Darij Grinberg, Luciano Margara |
| 2020 | Tree Polymatrix Games Are PPAD-Hard. | Argyrios Deligkas, John Fearnley, Rahul Savani |
| 2020 | An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs. | Anindya De, Sanjeev Khanna, Huan Li, Hesam Nikpey |
| 2020 | On the Structure of Solution Sets to Regular Word Equations. | Joel D. Day, Florin Manea |