Lauri Hella

2008
27	EE	Lauri Hella, Merlijn Sevenster, Tero Tulenheimo: Partially Ordered Connectives and Monadic Monotone Strict NP. Journal of Logic, Language and Information 17(3): 323-344 (2008)
26	EE	Miguel Couceiro, Lauri Hella, Jari Kivelä: Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic. Logic Journal of the IGPL 16(1): 43-73 (2008)
2006
25	EE	Lauri Hella, Jose Maria Turull Torres: Complete Problems for Higher Order Logics. CSL 2006: 380-394
24	EE	Lauri Hella, Jose Maria Turull Torres: Computing queries with higher-order logics. Theor. Comput. Sci. 355(2): 197-214 (2006)
2003
23	EE	Lauri Hella, Jose Maria Turull Torres: Expressibility of Higher Order Logics. Electr. Notes Theor. Comput. Sci. 84: (2003)
22	EE	Lauri Hella: Quantifying over Quantifiers. Electr. Notes Theor. Comput. Sci. 84: (2003)
21	EE	Kjell Lemström, Lauri Hella: Approximate pattern matching and transitive closure logics. Theor. Comput. Sci. 1-3(299): 387-412 (2003)
2001
20	EE	Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong: Logics with aggregate operators. J. ACM 48(4): 880-907 (2001)
2000
19	EE	Kjell Lemström, Lauri Hella: Approximate Pattern Matching is Expressible in Transitive Closure Logic. LICS 2000: 157-167
18	EE	Lauri Hella, Juha Nurmonen: Vectorization hierarchies of some graph quantifiers. Arch. Math. Log. 39(3): 183-207 (2000)
1999
17	EE	Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong: Logics with Aggregate Operators. LICS 1999: 35-44
16		Lauri Hella, Leonid Libkin, Juha Nurmonen: Notions of Locality and Their Logical Characterizations over Finite Models. J. Symb. Log. 64(4): 1751-1773 (1999)
1998
15		Anuj Dawar, Lauri Hella, Anil Seth: Ordering Finite Variable Types with Generalized Quantifiers. LICS 1998: 28-43
14		Lauri Hella, Henrik Imhof: Enhancing Fixed Point Logic with Cardinality Quantifiers. J. Log. Comput. 8(1): 71-86 (1998)
13		Anuj Dawar, Georg Gottlob, Lauri Hella: Capturing Relativized Complexity Classes without Order. Math. Log. Q. 44: 109-122 (1998)
1997
12		Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto: How to Define a Linear Order on Finite Models. Ann. Pure Appl. Logic 87(3): 241-267 (1997)
11		Lauri Hella, Jouko A. Väänänen, Dag Westerståhl: Definability of Polyadic Lifts of Generalized Quantifiers. Journal of Logic, Language and Information 6(3): 305-335 (1997)
1996
10	EE	Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto: Almost everywhere equivalence of logics in finite model theory. Bulletin of Symbolic Logic 2(4): 422-443 (1996)
9		Lauri Hella: Logical Hierarchies in PTIME. Inf. Comput. 129(1): 1-19 (1996)
8		Lauri Hella, Kerkko Luosto, Jouko A. Väänänen: The Hierarchy Theorem for Generalized Quantifiers. J. Symb. Log. 61(3): 802-817 (1996)
1995
7		Anuj Dawar, Lauri Hella, Phokion G. Kolaitis: Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP 1995: 624-635
6		Anuj Dawar, Lauri Hella: The expressive Power of Finitely Many Generalized Quantifiers. Inf. Comput. 123(2): 172-184 (1995)
1994
5		Anuj Dawar, Lauri Hella: The Expressive Power of Finitely Many Generalized Quantifiers LICS 1994: 20-29
4		Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto: How to Define a Linear Order on Finite Models LICS 1994: 40-49
1992
3		Lauri Hella: Logical Hierarchies in PTIME LICS 1992: 360-368
2		Lauri Hella, Kerkko Luosto: The Beth-Closure of L(Qalpha) Is Not Finitely Generated. J. Symb. Log. 57(2): 442-448 (1992)
1989
1		Lauri Hella: Definability Hierarchies of Generalized Quantifiers. Ann. Pure Appl. Logic 43(3): 235-271 (1989)

Coauthor Index

1	Miguel Couceiro	[26]
2	Anuj Dawar	[5] [6] [7] [13] [15]
3	Georg Gottlob	[13]
4	Henrik Imhof	[14]
5	Jari Kivelä	[26]
6	Phokion G. Kolaitis	[4] [7] [10] [12]
7	Kjell Lemström	[19] [21]
8	Leonid Libkin	[16] [17] [20]
9	Kerkko Luosto	[2] [4] [8] [10] [12]
10	Juha Nurmonen	[16] [17] [18] [20]
11	Anil Seth	[15]
12	Merlijn Sevenster	[27]
13	Jose Maria Turull Torres	[23] [24] [25]
14	Tero Tulenheimo	[27]
15	Jouko A. Väänänen	[8] [11]
16	Dag Westerståhl	[11]
17	Limsoon Wong	[17] [20]

Colors in the list of coauthors