| 2020 | Even Faster Algorithms for CSAT Over supernilpotent Algebras. | Piotr Kawalek, Jacek Krzaczkowski |
| 2020 | On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. | Toghrul Karimov, Jol Ouaknine, James Worrell |
| 2020 | Quantum-Inspired Classical Algorithms for Singular Value Transformation. | Dhawal Jethwani, Franois Le Gall, Sanjay Kumar Singh |
| 2020 | A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. | Vt Jelnek, Michal Opler, Jakub Pekrek |
| 2020 | Unary Prime Languages. | Ismal Jecker, Orna Kupferman, Nicolas Mazzocchi |
| 2020 | Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. | Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary |
| 2020 | Structural Parameterizations of Clique Coloring. | Lars Jaffke, Paloma T. Lima, Geevarghese Philip |
| 2020 | On Affine Reachability Problems. | Stefan Jaax, Stefan Kiefer |
| 2020 | Hierarchical Clusterings of Unweighted Graphs. | Svein Hgemo, Christophe Paul, Jan Arne Telle |
| 2020 | ∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. | Kristoffer Arnsfelt Hansen, Steffan Christ Slvsten |
| 2020 | Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. | Emirhan Grpinar, Andrei Romashchenko |
| 2020 | Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. | Zeyu Guo |
| 2020 | Fractional Covers of Hypergraphs with Bounded Multi-Intersection. | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |
| 2020 | A Quasiorder-Based Perspective on Residual Automata. | Pierre Ganty, Elena Gutirrez, Pedro Valero |
| 2020 | Graph Clustering in All Parameter Regimes. | Junhao Gan, David F. Gleich, Nate Veldt, Anthony Wirth, Xin Zhang |
| 2020 | Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. | Paul Gallot, Aurlien Lemay, Sylvain Salvati |
| 2020 | Fast Algorithms for General Spin Systems on Bipartite Expanders. | Andreas Galanis, Leslie Ann Goldberg, James Stewart |
| 2020 | The Complexity of Approximating the Complex-Valued Potts Model. | Andreas Galanis, Leslie Ann Goldberg, Andrs Herrera-Poyatos |
| 2020 | Building Large k-Cores from Sparse Graphs. | Fedor V. Fomin, Danil Sagunov, Kirill Simonov |
| 2020 | Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. | Nathanal Fijalkow, Pawel Gawrychowski, Pierre Ohlmann |
| 2020 | Synchronizing Deterministic Push-Down Automata Can Be Really Hard. | Henning Fernau, Petra Wolf, Tomoyuki Yamakami |
| 2020 | The Mergegram of a Dendrogram and Its Stability. | Yury Elkin, Vitaliy Kurlin |
| 2020 | Extending Nearly Complete 1-Planar Drawings in Polynomial Time. | Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, Martin Nllenburg |
| 2020 | Randomization in Non-Uniform Finite Automata. | Pavol Duris, Rastislav Krlovic, Richard Krlovic, Dana Pardubsk, Martin Pasen, Peter Rossmanith |
| 2020 | Register Transducers Are Marble Transducers. | Gatan Douneau-Tabot, Emmanuel Filiot, Paul Gastin |