The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Anuj Dawar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Anuj Dawar, Steven Lindell, Scott Weinstein
    Infinitary Logic and Inductive Definability over Finite Structures [Citation Graph (4, 0)][DBLP]
    Inf. Comput., 1995, v:119, n:2, pp:160-175 [Journal]
  2. Anuj Dawar, Steven Lindell, Scott Weinstein
    First Order Logic, Fixed Point Logic and Linear Order. [Citation Graph (1, 0)][DBLP]
    CSL, 1995, pp:161-177 [Conf]
  3. Anuj Dawar
    A Restricted Second Order Logic for Finite Structures. [Citation Graph (1, 0)][DBLP]
    LCC, 1994, pp:393-413 [Conf]
  4. Anuj Dawar, K. Vijay-Shanker
    A Three-Valued Interpretation of Negation in Feature Structure Descriptions. [Citation Graph (0, 0)][DBLP]
    ACL, 1989, pp:18-24 [Conf]
  5. Anuj Dawar
    How Many First-order Variables are Needed on Finite Ordered Structures? [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:489-520 [Conf]
  6. Anuj Dawar, Erich Grädel, Stephan Kreutzer
    Inflationary Fixed Points in Modal Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:277-291 [Conf]
  7. Anuj Dawar, David Richerby
    A Fixed-Point Logic with Symmetric Choice. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:169-182 [Conf]
  8. Anuj Dawar, Philippa Gardner, Giorgio Ghelli
    Adjunct Elimination Through Games in Static Ambient Logic. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:211-223 [Conf]
  9. Anuj Dawar, David Janin
    On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:224-236 [Conf]
  10. Anuj Dawar, Stephan Kreutzer
    Generalising Automaticity to Modal Properties of Finite Structures. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:109-120 [Conf]
  11. Albert Atserias, Anuj Dawar, Martin Grohe
    Preservation Under Extensions on Well-Behaved Finite Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1437-1449 [Conf]
  12. Anuj Dawar, Erich Grädel, Stephan Kreutzer
    Backtracking Games and Inflationary Fixed Points. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:420-432 [Conf]
  13. 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]
  14. Anuj Dawar, Erich Grädel
    Generalized Quantifiers and 0-1 Laws [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:54-64 [Conf]
  15. Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
    Approximation Schemes for First-Order Definable Optimisation Problems. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:411-420 [Conf]
  16. Anuj Dawar, Lauri Hella
    The Expressive Power of Finitely Many Generalized Quantifiers [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:20-29 [Conf]
  17. Anuj Dawar, Lauri Hella, Anil Seth
    Ordering Finite Variable Types with Generalized Quantifiers. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:28-43 [Conf]
  18. Anuj Dawar, Martin Otto
    Modal Characterisation Theorems over Special Classes of Frames. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:21-30 [Conf]
  19. Paul Hunter, Anuj Dawar
    Complexity Bounds for Regular Games. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:495-506 [Conf]
  20. Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
    On Preservation under Homomorphisms and Unions of Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:319-329 [Conf]
  21. Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer
    DAG-Width and Parity Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:524-536 [Conf]
  22. Anuj Dawar, Yuri Gurevich
    Fixed point logics. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2002, v:8, n:1, pp:65-88 [Journal]
  23. Anuj Dawar, K. Vijay-Shanker
    An Interpretation of Negation in Feature Structure Descriptions. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 1990, v:16, n:1, pp:11-21 [Journal]
  24. Anuj Dawar
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:90, n:1, pp:- [Journal]
  25. Anuj Dawar, David Richerby, Benjamin Rossman
    Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:143, n:, pp:13-26 [Journal]
  26. Anuj Dawar
    A Restricted Second Order Logic for Finite Structures. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:143, n:2, pp:154-174 [Journal]
  27. 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]
  28. Anuj Dawar, Daniel Leivant
    Guest editorial. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:183, n:1, pp:1- [Journal]
  29. Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
    On preservation under homomorphisms and unions of conjunctive queries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:2, pp:208-237 [Journal]
  30. Anuj Dawar
    Generalized Quantifiers and Logical Reducibilities. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1995, v:5, n:2, pp:213-226 [Journal]
  31. Anuj Dawar, David Richerby
    Fixed-point Logics with Nondeterministic Choice. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2003, v:13, n:4, pp:503-530 [Journal]
  32. Anuj Dawar, Kees Doets, Steven Lindell, Scott Weinstein
    Elementary Properties of the Finite Ranks. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:349-353 [Journal]
  33. 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]
  34. Anuj Dawar, Erich Grädel, Stephan Kreutzer
    Backtracking games and inflationary fixed points. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:350, n:2-3, pp:174-187 [Journal]
  35. Anuj Dawar, Erich Grädel, Stephan Kreutzer
    Inflationary fixed points in modal logic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:2, pp:282-315 [Journal]
  36. Anuj Dawar
    Model-Checking First-Order Logic: Automata and Locality. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:6- [Conf]
  37. Anuj Dawar, David Richerby
    The Power of Counting Logics on Restricted Classes of Finite Structures. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:84-98 [Conf]
  38. Albert Atserias, Andrei A. Bulatov, Anuj Dawar
    Affine Systems of Equations and Counting Infinitary Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:558-570 [Conf]
  39. Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
    Model Theory Makes Formulas Large. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:913-924 [Conf]
  40. Anuj Dawar, Martin Grohe, Stephan Kreutzer
    Locally Excluding a Minor. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:270-279 [Conf]
  41. Anuj Dawar
    Finite Model Theory on Tame Classes of Structures. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:2-12 [Conf]
  42. Anuj Dawar, Philippa Gardner, Giorgio Ghelli
    Expressiveness and complexity of graph logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:3, pp:263-310 [Journal]
  43. Anuj Dawar, David Janin
    The monadic theory of finite representations of infinite words. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:103, n:3, pp:94-101 [Journal]
  44. Anuj Dawar, Stephan Kreutzer
    Generalising automaticity to modal properties of finite structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:1-2, pp:266-285 [Journal]

  45. On Complete Problems, Relativizations and Logics for Complexity Classes. [Citation Graph (, )][DBLP]


  46. The Descriptive Complexity of Parity Games. [Citation Graph (, )][DBLP]


  47. Separating Graph Logic from MSO. [Citation Graph (, )][DBLP]


  48. Structure and Specification as Sources of Complexity. [Citation Graph (, )][DBLP]


  49. Domination Problems in Nowhere-Dense Classes. [Citation Graph (, )][DBLP]


  50. On Datalog vs. LFP. [Citation Graph (, )][DBLP]


  51. Logics with Rank Operators. [Citation Graph (, )][DBLP]


  52. Parameterized Complexity Classes under Logical Reductions. [Citation Graph (, )][DBLP]


  53. On the Descriptive Complexity of Linear Algebra. [Citation Graph (, )][DBLP]


  54. Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. [Citation Graph (, )][DBLP]


  55. Modal characterisation theorems over special classes of frames. [Citation Graph (, )][DBLP]


  56. Homomorphism Preservation on Quasi-Wide Classes [Citation Graph (, )][DBLP]


  57. Domination Problems in Nowhere-Dense Classes of Graphs [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
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