| 2020 | The Surprising Power of Constant Depth Algebraic Proofs. | Russell Impagliazzo, Sasank Mouli, Toniann Pitassi |
| 2020 | Intermediate problems in modular circuits satisfiability. | Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski |
| 2020 | A calculus of expandable stores: Continuation-and-environment-passing style translations. | Hugo Herbelin, tienne Miquey |
| 2020 | Descriptive complexity of real computation and probabilistic independence logic. | Miika Hannula, Juha Kontinen, Jan Van den Bussche, Jonni Virtema |
| 2020 | A tier-based typed programming language characterizing Feasible Functionals. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2020 | Modal Intuitionistic Logics as Dialgebraic Logics. | Jim de Groot, Dirk Pattinson |
| 2020 | Counting Bounded Tree Depth Homomorphisms. | Martin Grohe |
| 2020 | Multimodal Dependent Type Theory. | Daniel Gratzer, G. A. Kavvos, Andreas Nuyts, Lars Birkedal |
| 2020 | Successor-Invariant First-Order Logic on Classes of Bounded Degree. | Julien Grange |
| 2020 | Automatic Structures: Twenty Years Later. | Erich Grdel |
| 2020 | A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity. | Clemens Grabmayer, Wan J. Fokkink |
| 2020 | Bisimulation Finiteness of Pushdown Systems Is Elementary. | Stefan Gller, Pawel Parys |
| 2020 | Linear Dependent Type Theory for Quantum Programming Languages: Extended Abstract. | Peng Fu, Kohei Kishida, Peter Selinger |
| 2020 | Coherence and normalisation-by-evaluation for bicategorical cartesian closed structure. | Marcelo Fiore, Philip Saville |
| 2020 | Lower Bounds for QBFs of Bounded Treewidth. | Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler |
| 2020 | One-Clock Priced Timed Games are PSPACE-hard. | John Fearnley, Rasmus Ibsen-Jensen, Rahul Savani |
| 2020 | Uniformisations of Regular Relations Over Bi-Infinite Words. | Grzegorz Fabianski, Michal Skrzypczak, Szymon Torunczyk |
| 2020 | Cones as a model of intuitionistic linear logic. | Thomas Ehrhard |
| 2020 | An Approach to Regular Separability in Vector Addition Systems. | Wojciech Czerwinski, Georg Zetzsche |
| 2020 | The Benefit of Being Non-Lazy in Probabilistic λ-calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name. | Gianluca Curzi, Michele Pagani |
| 2020 | Re-pairing brackets. | Dmitry Chistikov, Mikhail N. Vyalyi |
| 2020 | A Fixed Point Theorem on Lexicographic Lattice Structures. | Angelos Charalambidis, Giannos Chatziagapis, Panos Rondogiannis |
| 2020 | On the Weisfeiler-Leman Dimension of Finite Groups. | Jendrik Brachter, Pascal Schweitzer |
| 2020 | A Cellular Howe Theorem. | Peio Borthelle, Tom Hirschowitz, Ambroise Lafont |
| 2020 | A tale of intersection types. | Viviana Bono, Mariangiola Dezani-Ciancaglini |