| 2026 | CSL | Arity Hierarchies for Quantifiers Closed Under Partial Polymorphisms. | Anuj Dawar, Lauri Hella, Benedikt Pago |
| 2024 | CSL | Quantifiers Closed Under Partial Polymorphisms. | Anuj Dawar, Lauri Hella |
| 2023 | CSL | The Expressive Power of CSP-Quantifiers. | Lauri Hella |
| 2023 | MFCS | Descriptive Complexity for Distributed Computing with Circuits. | Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto |
| 2022 | CiE | Defining Long Words Succinctly in FO and MSO. | Lauri Hella, Miikka Vilander |
| 2019 | WoLLIC | Complexity Thresholds in Inclusion Logic. | Miika Hannula, Lauri Hella |
| 2017 | MFCS | Model Checking and Validity in Propositional and Modal Inclusion Logics. | Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema |
| 2017 | WoLLIC | Independence-Friendly Logic Without Henkin Quantification. | Fausto Barbero, Lauri Hella, Raine Rnnholm |
| 2016 | AiML | The succinctness of first-order logic over modal logic via a formula size game. | Lauri Hella, Miikka Vilander |
| 2016 | CSL | Dependence Logic vs. Constraint Satisfaction. | Lauri Hella, Phokion G. Kolaitis |
| 2015 | MFCS | Modal Inclusion Logic: Being Lax is Simpler than Being Strict. | Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer |
| 2014 | AiML | One-dimensional Fragment of First-order Logic. | Lauri Hella, Antti Kuusisto |
| 2014 | AiML | The Expressive Power of Modal Dependence Logic. | Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni Virtema |
| 2013 | CSL | Inclusion Logic and Fixed Point Logic. | Pietro Galliani, Lauri Hella |
| 2013 | WoLLIC | Boolean Dependence Logic and Partially-Ordered Connectives. | Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema |
| 2013 | WoLLIC | Extended Modal Dependence Logic. | Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Mller, Jonni Virtema, Heribert Vollmer |
| 2012 | PODC | Weak models of distributed computing, with connections to modal logic. | Lauri Hella, Matti Jrvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema |
| 2006 | CSL | Complete Problems for Higher Order Logics. | Lauri Hella, Jose Maria Turull Torres |
| 2000 | LICS | Approximate Pattern Matching is Expressible in Transitive Closure Logic. | Kjell Lemstrm, Lauri Hella |
| 1999 | LICS | Logics with Aggregate Operators. | Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong |
| 1998 | LICS | Ordering Finite Variable Types with Generalized Quantifiers. | Anuj Dawar, Lauri Hella, Anil Seth |
| 1995 | ICALP | Implicit Definability and Infinitary Logic in Finite Model Theory. | Anuj Dawar, Lauri Hella, Phokion G. Kolaitis |
| 1994 | LICS | The Expressive Power of Finitely Many Generalized Quantifiers | Anuj Dawar, Lauri Hella |
| 1994 | LICS | How to Define a Linear Order on Finite Models | Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto |
| 1992 | LICS | Logical Hierarchies in PTIME | Lauri Hella |