Lauri Hella - RankMe

83 papers A* 8B 11C 7Journal 52Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Arity Hierarchies for Quantifiers Closed Under Partial Polymorphisms. CSL Anuj Dawar, Lauri Hella, Benedikt Pago
2025	J	`jnl`	Arity hierarchies for quantifiers closed under partial polymorphisms. CoRR Anuj Dawar, Lauri Hella, Benedikt Pago
2025	J	`jnl`	Descriptive complexity for distributed computing with circuits. J. Log. Comput. Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto
2025	J	`jnl`	Regular Representations of Uniform TC ACM Trans. Comput. Log. Lauri Hella, Juha Kontinen, Kerkko Luosto
2024	J	`jnl`	Defining long words succinctly in FO and MSO. Comput. Lauri Hella, Miikka Vilander
2024	J	`jnl`	Dimension in team semantics. Math. Struct. Comput. Sci. Lauri Hella, Kerkko Luosto, Jouko Väänänen
2024	J	`jnl`	Game characterizations for the number of quantifiers. Math. Struct. Comput. Sci. Lauri Hella, Kerkko Luosto
2024	B	`conf`	Quantifiers Closed Under Partial Polymorphisms. CSL Anuj Dawar, Lauri Hella
2023	B	`conf`	Descriptive Complexity for Distributed Computing with Circuits. MFCS Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto
2023	J	`jnl`	Descriptive complexity for distributed computing with circuits. CoRR Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto
2023	J	`jnl`	Quantifiers closed under partial polymorphisms. CoRR Anuj Dawar, Lauri Hella
2023	J	`jnl`	Regular Representations of Uniform TC^0. CoRR Lauri Hella, Juha Kontinen, Kerkko Luosto
2023	B	`conf`	The Expressive Power of CSP-Quantifiers. CSL Lauri Hella
2022	J	`jnl`	Bounded game-theoretic semantics for modal mu-calculus. Inf. Comput. Lauri Hella, Antti Kuusisto, Raine Rönnholm
2022	J	`jnl`	Complexity thresholds in inclusion logic. Inf. Comput. Miika Hannula, Lauri Hella
2022	C	`conf`	Defining Long Words Succinctly in FO and MSO. CiE Lauri Hella, Miikka Vilander
2022	J	`jnl`	Defining long words succinctly in FO and MSO. CoRR Lauri Hella, Miikka Vilander
2021	J	`jnl`	A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value. CoRR Antti Valmari, Lauri Hella
2021	J	`jnl`	Independence-friendly logic without Henkin quantification. Arch. Math. Log. Fausto Barbero, Lauri Hella, Raine Rönnholm
2020	—	`conf`	Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants. GandALF Lauri Hella, Antti Kuusisto, Raine Rönnholm
2020	J	`jnl`	Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. ACM Trans. Comput. Log. Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2019	C	`conf`	Complexity Thresholds in Inclusion Logic. WoLLIC Miika Hannula, Lauri Hella
2019	J	`jnl`	Complexity Thresholds in Inclusion Logic. CoRR Miika Hannula, Lauri Hella
2019	J	`jnl`	Formula size games for modal logic and μ-calculus. CoRR Lauri Hella, Miikka Vilander
2019	J	`jnl`	Formula size games for modal logic and μ-calculus. J. Log. Comput. Lauri Hella, Miikka Vilander
2019	J	`jnl`	Model checking and validity in propositional and modal inclusion logics. J. Log. Comput. Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
2017	J	`jnl`	Boolean dependence logic and partially-ordered connectives. J. Comput. Syst. Sci. Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema
2017	J	`jnl`	Bounded game-theoretic semantics for modal mu-calculus. CoRR Lauri Hella, Antti Kuusisto, Raine Rönnholm
2017	C	`conf`	Independence-Friendly Logic Without Henkin Quantification. WoLLIC Fausto Barbero, Lauri Hella, Raine Rönnholm
2017	B	`conf`	Model Checking and Validity in Propositional and Modal Inclusion Logics. MFCS Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
2016	B	`conf`	Dependence Logic vs. Constraint Satisfaction. CSL Lauri Hella, Phokion G. Kolaitis
2016	J	`jnl`	Existential second-order logic and modal logic with quantified accessibility relations. Inf. Comput. Lauri Hella, Antti Kuusisto
2016	J	`jnl`	Model Checking and Validity in Propositional and Modal Inclusion Logics. CoRR Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema
2016	J	`jnl`	The Succinctness of First-order Logic over Modal Logic via a Formula Size Game. CoRR Lauri Hella, Miikka Vilander
2016	B	`conf`	The succinctness of first-order logic over modal logic via a formula size game. Advances in Modal Logic Lauri Hella, Miikka Vilander
2015	—	`conf`	Modal Inclusion Logic: Being Lax is Simpler than Being Strict. MFCS (1) Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2015	J	`jnl`	Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics. CoRR Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2015	—	`ch.`	The Size of a Formula as a Measure of Complexity. Logic Without Borders Lauri Hella, Jouko Väänänen
2015	—	`conf`	The expressive power of modal logic with inclusion atoms. GandALF Lauri Hella, Johanna Stumpf
2015	J	`jnl`	Weak models of distributed computing, with connections to modal logic. Distributed Comput. Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema
2014	J	`jnl`	Boolean Dependence Logic and Partially-Ordered Connectives. CoRR Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema
2014	B	`conf`	One-dimensional Fragment of First-order Logic. Advances in Modal Logic Lauri Hella, Antti Kuusisto
2014	J	`jnl`	One-dimensional fragment of first-order logic. CoRR Lauri Hella, Antti Kuusisto
2014	B	`conf`	The Expressive Power of Modal Dependence Logic. Advances in Modal Logic Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni Virtema
2014	J	`jnl`	The Expressive Power of Modal Dependence Logic. CoRR Lauri Hella, Kerkko Luosto, Katsuhiko Sano, Jonni Virtema
2013	C	`conf`	Boolean Dependence Logic and Partially-Ordered Connectives. WoLLIC Johannes Ebbing, Lauri Hella, Peter Lohmann, Jonni Virtema
2013	C	`conf`	Extended Modal Dependence Logic. WoLLIC Johannes Ebbing, Lauri Hella, Arne Meier, Julian-Steffen Müller, Jonni Virtema, Heribert Vollmer
2013	J	`jnl`	Inclusion Logic and Fixed Point Logic CoRR Pietro Galliani, Lauri Hella
2013	B	`conf`	Inclusion Logic and Fixed Point Logic. CSL Pietro Galliani, Lauri Hella
2013	J	`jnl`	On the existence of a modal-logical basis for monadic second-order logic. J. Log. Comput. Lauri Hella, Tero Tulenheimo
2012	J	`jnl`	The size of a formula as a measure of complexity CoRR Lauri Hella, Jouko A. Väänänen
2012	J	`jnl`	Weak Models of Distributed Computing, with Connections to Modal Logic CoRR Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema
2012	A*	`conf`	Weak models of distributed computing, with connections to modal logic. PODC Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema
2009	—	`conf`	Monadic Sigma M4M Lauri Hella, Antti Kuusisto
2008	J	`jnl`	Partially Ordered Connectives and Monadic Monotone Strict NP. J. Log. Lang. Inf. Lauri Hella, Merlijn Sevenster, Tero Tulenheimo
2008	J	`jnl`	Term Definable Classes of Boolean Functions and Frame Definability in Modal Logic. Log. J. IGPL Miguel Couceiro, Lauri Hella, Jari Kivelä
2006	B	`conf`	Complete Problems for Higher Order Logics. CSL Lauri Hella, Jose Maria Turull Torres
2006	J	`jnl`	Computing queries with higher-order logics. Theor. Comput. Sci. Lauri Hella, Jose Maria Turull Torres
2003	J	`jnl`	Approximate pattern matching and transitive closure logics. Theor. Comput. Sci. Kjell Lemström, Lauri Hella
2003	C	`conf`	Expressibility of Higher Order Logics. WoLLIC Lauri Hella, Jose Maria Turull Torres
2003	C	`conf`	Quantifying over Quantifiers. WoLLIC Lauri Hella
2001	J	`jnl`	Logics with aggregate operators. J. ACM Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong
2000	A*	`conf`	Approximate Pattern Matching is Expressible in Transitive Closure Logic. LICS Kjell Lemström, Lauri Hella
2000	J	`jnl`	Vectorization hierarchies of some graph quantifiers. Arch. Math. Log. Lauri Hella, Juha Nurmonen
1999	A*	`conf`	Logics with Aggregate Operators. LICS Lauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong
1999	J	`jnl`	Notions of Locality and Their Logical Characterizations over Finite Models. J. Symb. Log. Lauri Hella, Leonid Libkin, Juha Nurmonen
1998	J	`jnl`	Capturing Relativized Complexity Classes without Order. Math. Log. Q. Anuj Dawar, Georg Gottlob, Lauri Hella
1998	J	`jnl`	Enhancing Fixed Point Logic with Cardinality Quantifiers. J. Log. Comput. Lauri Hella, Henrik Imhof
1998	A*	`conf`	Ordering Finite Variable Types with Generalized Quantifiers. LICS Anuj Dawar, Lauri Hella, Anil Seth
1997	J	`jnl`	Definability of Polyadic Lifts of Generalized Quantifiers. J. Log. Lang. Inf. Lauri Hella, Jouko A. Väänänen, Dag Westerståhl
1997	J	`jnl`	How to Define a Linear Order on Finite Models. Ann. Pure Appl. Log. Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto
1996	J	`jnl`	A double arity hierarchy theorem for transitive closure logic. Arch. Math. Log. Martin Grohe, Lauri Hella
1996	J	`jnl`	Almost everywhere equivalence of logics in finite model theory. Bull. Symb. Log. Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto
1996	J	`jnl`	Logical Hierarchies in PTIME. Inf. Comput. Lauri Hella
1996	J	`jnl`	The Hierarchy Theorem for Generalized Quantifiers. J. Symb. Log. Lauri Hella, Kerkko Luosto, Jouko A. Väänänen
1995	A*	`conf`	Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP Anuj Dawar, Lauri Hella, Phokion G. Kolaitis
1995	J	`jnl`	The expressive Power of Finitely Many Generalized Quantifiers. Inf. Comput. Anuj Dawar, Lauri Hella
1994	A*	`conf`	How to Define a Linear Order on Finite Models LICS Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto
1994	A*	`conf`	The Expressive Power of Finitely Many Generalized Quantifiers LICS Anuj Dawar, Lauri Hella
1992	A*	`conf`	Logical Hierarchies in PTIME LICS Lauri Hella
1992	J	`jnl`	The Beth-Closure of L(Q J. Symb. Log. Lauri Hella, Kerkko Luosto
1991	J	`jnl`	Remarks on The Cartesian Closure. Math. Log. Q. Lauri Hella, Michal Krynicki
1989	J	`jnl`	Definability Hierarchies of Generalized Quantifiers. Ann. Pure Appl. Log. Lauri Hella