The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lauri Hella: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. Vectorization hierarchies of some graph quantifiers. [Citation Graph (, )][DBLP]


  26. Monadic Sigma11 and Modal Logic with Quantified Binary Relations. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002