Lauri Hella

928 total citations
41 papers, 300 citations indexed

About

Lauri Hella is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Lauri Hella has authored 41 papers receiving a total of 300 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Artificial Intelligence, 32 papers in Computational Theory and Mathematics and 7 papers in Computer Networks and Communications. Recurrent topics in Lauri Hella's work include Logic, Reasoning, and Knowledge (28 papers), Logic, programming, and type systems (17 papers) and Advanced Algebra and Logic (16 papers). Lauri Hella is often cited by papers focused on Logic, Reasoning, and Knowledge (28 papers), Logic, programming, and type systems (17 papers) and Advanced Algebra and Logic (16 papers). Lauri Hella collaborates with scholars based in Finland, Germany and United States. Lauri Hella's co-authors include Leonid Libkin, Phokion G. Kolaitis, Limsoon Wong, Anuj Dawar, Jouko Väänánen, Pietro Galliani, Dag Westerståhl, Katsuhiko Sano, Martin Grohe and Arne Meier and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and Theoretical Computer Science.

In The Last Decade

Lauri Hella

32 papers receiving 275 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Lauri Hella Finland 9 234 196 61 32 29 41 300
Celia Wrathall United States 9 388 1.7× 269 1.4× 37 0.6× 47 1.5× 15 0.5× 19 450
Eugenio G. Omodeo Italy 10 311 1.3× 294 1.5× 86 1.4× 35 1.1× 23 0.8× 63 423
Robin Hirsch United Kingdom 12 293 1.3× 303 1.5× 94 1.5× 32 1.0× 25 0.9× 46 387
Hubie Chen Spain 11 234 1.0× 169 0.9× 193 3.2× 35 1.1× 39 1.3× 52 364
Miki Hermann France 7 185 0.8× 126 0.6× 63 1.0× 6 0.2× 22 0.8× 24 251
Jan Kára Czechia 8 154 0.7× 62 0.3× 132 2.2× 47 1.5× 19 0.7× 16 222
Isolde Adler Germany 8 190 0.8× 53 0.3× 87 1.4× 24 0.8× 26 0.9× 21 231
Mitsunori Ogiwara Japan 9 288 1.2× 200 1.0× 58 1.0× 4 0.1× 17 0.6× 19 321
Thomas Colcombet France 9 170 0.7× 192 1.0× 41 0.7× 14 0.4× 18 0.6× 35 255
John Doner United States 5 217 0.9× 195 1.0× 37 0.6× 13 0.4× 9 0.3× 8 277

Countries citing papers authored by Lauri Hella

Since Specialization
Citations

This map shows the geographic impact of Lauri Hella's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Lauri Hella with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lauri Hella more than expected).

Fields of papers citing papers by Lauri Hella

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Lauri Hella. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Lauri Hella. The network helps show where Lauri Hella may publish in the future.

Co-authorship network of co-authors of Lauri Hella

This figure shows the co-authorship network connecting the top 25 collaborators of Lauri Hella. A scholar is included among the top collaborators of Lauri Hella based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Lauri Hella. Lauri Hella is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hella, Lauri, et al.. (2025). Descriptive complexity for distributed computing with circuits. Journal of Logic and Computation. 35(5).
2.
Hella, Lauri, et al.. (2024). Dimension in team semantics. Mathematical Structures in Computer Science. 34(5). 410–454.
3.
Hella, Lauri, et al.. (2021). Complexity thresholds in inclusion logic. Information and Computation. 287. 104759–104759.
4.
Hella, Lauri, et al.. (2019). Satisfiability of Modal Inclusion Logic. ACM Transactions on Computational Logic. 21(1). 1–18. 3 indexed citations
5.
Hella, Lauri, et al.. (2017). Boolean dependence logic and partially-ordered connectives. Journal of Computer and System Sciences. 88. 103–125. 1 indexed citations
6.
Hella, Lauri, et al.. (2016). The succinctness of first-order logic over modal logic via a formula size game.. arXiv (Cornell University). 401–419. 1 indexed citations
7.
Hella, Lauri, et al.. (2015). The expressive power of modal logic with inclusion atoms. SHILAP Revista de lepidopterología. 193. 129–143. 8 indexed citations
8.
Galliani, Pietro & Lauri Hella. (2014). Inclusion Logic and Fixed Point Logic. IrInSubria (University of Insubria). 9 indexed citations
9.
Hella, Lauri, et al.. (2014). The Expressive Power of Modal Dependence Logic. arXiv (Cornell University). 294–312. 6 indexed citations
10.
Hella, Lauri, et al.. (2006). Computing queries with higher-order logics. Theoretical Computer Science. 355(2). 197–214. 6 indexed citations
11.
Dawar, Anuj, Lauri Hella, & Anil K. Seth. (2002). Ordering finite variable types with generalized quantifiers. 702. 28–43. 1 indexed citations
12.
Hella, Lauri, et al.. (2002). How to define a linear order on finite models. 51. 40–49. 4 indexed citations
13.
Dawar, Anuj & Lauri Hella. (2002). The expressive power of finitely many generalized quantifiers. 20–29. 6 indexed citations
14.
Hella, Lauri, et al.. (2000). Vectorization hierarchies of some graph quantifiers. Archive for Mathematical Logic. 39(3). 183–207.
15.
Hella, Lauri, et al.. (1999). Notions of locality and their logical characterizations over finite models. Journal of Symbolic Logic. 64(4). 1751–1773. 27 indexed citations
16.
Hella, Lauri, et al.. (1997). How to define a linear order on finite models. Annals of Pure and Applied Logic. 87(3). 241–267. 6 indexed citations
17.
Hella, Lauri. (1996). Logical Hierarchies in PTIME. Information and Computation. 129(1). 1–19. 59 indexed citations
18.
Grohe, Martin & Lauri Hella. (1996). A double arity hierarchy theorem for transitive closure logic. Archive for Mathematical Logic. 35(3). 157–171. 2 indexed citations
19.
Dawar, Anuj & Lauri Hella. (1995). The Expressive Power of Finitely Many Generalized Quantifiers. Information and Computation. 123(2). 172–184. 11 indexed citations
20.
Hella, Lauri. (1989). Definability hierarchies of generalized quantifiers. Annals of Pure and Applied Logic. 43(3). 235–271. 37 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Celia Wrathall Breakdown of academic impact, for papers by Eugenio G. Omodeo Breakdown of academic impact, for papers by Robin Hirsch Breakdown of academic impact, for papers by Hubie Chen Breakdown of academic impact, for papers by Miki Hermann Breakdown of academic impact, for papers by Jan Kára Breakdown of academic impact, for papers by Isolde Adler Breakdown of academic impact, for papers by Mitsunori Ogiwara Breakdown of academic impact, for papers by Thomas Colcombet Breakdown of academic impact, for papers by John Doner
Rankless by CCL
2026