Dawar, Anuj - Computer Laboratory, University of Cambridge

Advanced Search

Dawar, Anuj - Computer Laboratory, University of Cambridge

Separating Graph Logic from MSO Timos Antonopoulos and Anuj Dawar
On the bisimulation invariant fragment of monadic 1 in the nite
How Many First-order Variables are Needed on Finite Ordered Structures?
Approximation Schemes for First-Order Definable Optimisation Problems Anuj Dawar Martin Grohe Stephan Kreutzer Nicole Schweikardt
LIPIcs Leibniz International Proceedings in Informatics Domination Problems in
Ordering Finite Variable Types with Generalized Quanti ers Anuj Dawar
Adjunct Elimination Through Games in Static Ambient Logic
Finite Models and Finitely Many Variables Department of Computer Science
The Descriptive Complexity of Parity Games Anuj Dawar1
Complexity Bounds for Regular Games (Extended Abstract)
Locally Excluding a Minor University of Cambridge Computer Laboratory
Annals of Pure and Applied Logic 161 (2009) 142 Contents lists available at ScienceDirect
Logics with Rank Operators Martin Grohe
On Datalog vs. LFP Anuj Dawar and Stephan Kreutzer
Choiceless Polynomial Time, Counting and the CaiFurerImmerman Graphs
Model theory makes formulas large Anuj Dawar1
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Information and Computation 205 (2007) 263310 www.elsevier.com/locate/ic
Parameterized Complexity Classes Under Logical Anuj Dawar1
Implicit De nability and In nitary Logic in Finite Model Theory
Fundamenta Informaticae XX (2010) 122 1 Properties of Almost All Graphs and Generalized Quantifiers
Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2008 Society for Industrial and Applied Mathematics
Backtracking games and inflationary fixed University of Cambridge Computer Laboratory, Cambridge CB3 0FD, UK,
The Power of Counting Logics on Restricted Classes of Finite Structures
Finite Models and Finitely Many Variables Department of Computer Science, University of Wales Swansea, Singleton Park,
Generalising Automaticity to Modal Properties of Finite Structures