Anuj Dawar - RankMe

189 papers A* 27A 5B 35C 6Journal 95Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Arity Hierarchies for Quantifiers Closed Under Partial Polymorphisms. CSL Anuj Dawar, Lauri Hella, Benedikt Pago
2026	B	`conf`	Compactness in Semiring Semantics. CSL Sophie Brinke, Anuj Dawar, Erich Grädel, Lovro Mrkonjic, Matthias Naaf
2026	J	`jnl`	Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras. CoRR Anuj Dawar, Nihil Shah
2026	A	`conf`	Symmetric Algebraic Circuits and Homomorphism Polynomials. ITCS Anuj Dawar, Benedikt Pago, Tim Seppelt
2025	J	`jnl`	Arity hierarchies for quantifiers closed under partial polymorphisms. CoRR Anuj Dawar, Lauri Hella, Benedikt Pago
2025	J	`jnl`	Characterizing NC1 with Typed Monoids. CoRR Anuj Dawar, Aidan T. Evans
2025	—	`conf`	Characterizing NC¹ with Typed Monoids. FSTTCS Anuj Dawar, Aidan T. Evans
2025	J	`jnl`	Homomorphism Counts to Trees. Discret. Math. Theor. Comput. Sci. Anuj Dawar
2025	J	`jnl`	MSO undecidability for hereditary classes of unbounded clique-width. Eur. J. Comb. Anuj Dawar, Abhisekh Sankaran
2025	J	`jnl`	Symmetric Algebraic Circuits and Homomorphism Polynomials. CoRR Anuj Dawar, Benedikt Pago, Tim Seppelt
2025	B	`conf`	Symmetric Proofs in the Ideal Proof System. MFCS Anuj Dawar, Erich Grädel, Leon Kullmann, Benedikt Pago
2025	J	`jnl`	Symmetric Proofs in the Ideal Proof System. CoRR Anuj Dawar, Erich Grädel, Leon Kullmann, Benedikt Pago
2025	B	`conf`	Undefinability of Approximation of 2-To-2 Games. CSL Anuj Dawar, Bálint Molnár
2025	J	`jnl`	Undefinability of Approximation of 2-to-2 Games. CoRR Anuj Dawar, Bálint Molnár
2024	J	`jnl`	A Logic for P: Are we Nearly There Yet? ACM SIGLOG News Anuj Dawar, Benedikt Pago
2024	J	`jnl`	Corrigendum to "Homomorphism preservation on quasi-wide classes" [J. Comput. Syst. Sci. 76 (5) (2010) 324-332]. J. Comput. Syst. Sci. Anuj Dawar
2024	J	`jnl`	Game Comonads & Generalised Quantifiers. Log. Methods Comput. Sci. Adam Ó Conghaile, Anuj Dawar
2024	J	`jnl`	Homomorphism Counts to Trees. CoRR Anuj Dawar
2024	J	`jnl`	International Colloquium on Automata, Languages and Programming (ICALP 2020). Theory Comput. Syst. Anuj Dawar
2024	A*	`conf`	Limits of Symmetric Computation (Invited Talk). ICALP Anuj Dawar
2024	B	`conf`	Preservation Theorems on Sparse Classes Revisited. MFCS Anuj Dawar, Ioannis Eleftheriadis
2024	J	`jnl`	Preservation theorems on sparse classes revisited. CoRR Anuj Dawar, Ioannis Eleftheriadis
2024	B	`conf`	Quantifiers Closed Under Partial Polymorphisms. CSL Anuj Dawar, Lauri Hella
2023	A	`ed.`	40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, Hamburg, Germany, March 7-9, 2023 STACS Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté
2023	C	`conf`	Descriptive complexity of controllable graphs. LAGOS Aida Abiad, Anuj Dawar, Octavio Zapata
2023	J	`jnl`	Descriptive complexity of controllable graphs. CoRR Aida Abiad, Anuj Dawar, Octavio Zapata
2023	J	`jnl`	Limitations of the invertible-map equivalences. J. Log. Comput. Anuj Dawar, Erich Grädel, Moritz Lichter
2023	A*	`conf`	Monadic NIP in Monotone Classes of Relational Structures. ICALP Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos
2023	J	`jnl`	Monadic NIP in monotone classes of relational structures. CoRR Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos
2023	J	`jnl`	Quantifiers closed under partial polymorphisms. CoRR Anuj Dawar, Lauri Hella
2022	—	`ed.`	42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, IIT Madras, Chennai, India, December 18-20, 2022 FSTTCS Anuj Dawar, Venkatesan Guruswami
2022	J	`jnl`	Descriptive complexity of the generalized spectra of graphs. CoRR Aida Abiad, Anuj Dawar, Octavio Zapata
2022	A	`conf`	Lower Bounds for Symmetric Circuits for the Determinant. ITCS Anuj Dawar, Gregory Wilsenach
2022	B	`conf`	MSO Undecidability for Hereditary Classes of Unbounded Clique Width. CSL Anuj Dawar, Abhisekh Sankaran
2022	A*	`conf`	Separating LREC from LFP. LICS Anuj Dawar, Felipe Ferreira Santos
2022	J	`jnl`	Symmetric Circuits for Rank Logic. ACM Trans. Comput. Log. Anuj Dawar, Gregory Wilsenach
2021	B	`conf`	Extension Preservation in the Finite and Prefix Classes of First Order Logic. CSL Anuj Dawar, Abhisekh Sankaran
2021	B	`conf`	Game Comonads & Generalised Quantifiers. CSL Adam Ó Conghaile, Anuj Dawar
2021	J	`jnl`	Limitations of the Invertible-Map Equivalences. CoRR Anuj Dawar, Erich Grädel, Moritz Lichter
2021	A*	`conf`	Lovász-Type Theorems and Game Comonads. LICS Anuj Dawar, Tomas Jakl, Luca Reggio
2021	J	`jnl`	Lovász-Type Theorems and Game Comonads. CoRR Anuj Dawar, Tomas Jakl, Luca Reggio
2021	J	`jnl`	Lower Bounds for Symmetric Circuits for the Determinant. CoRR Anuj Dawar, Gregory Wilsenach
2021	J	`jnl`	On the Power of Symmetric Linear Programs. J. ACM Albert Atserias, Anuj Dawar, Joanna Ochremiak
2021	B	`conf`	On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism. MFCS Anuj Dawar, Danny Vagnozzi
2021	J	`jnl`	On the relative power of algebraic approximations of graph isomorphism. CoRR Anuj Dawar, Danny Vagnozzi
2021	J	`jnl`	Separating LREC from LFP. CoRR Anuj Dawar, Felipe Ferreira Santos
2020	A*	`ed.`	47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Saarbrücken, Germany (Virtual Conference), July 8-11, 2020 ICALP Artur Czumaj, Anuj Dawar, Emanuela Merelli
2020	—	`conf`	Convergence and Nonconvergence Laws for Random Expansions of Product Structures. Fields of Logic and Computation III Anuj Dawar, Erich Grädel, Matthias Hoelzel
2020	J	`jnl`	Extension Preservation in the Finite and Prefix Classes of First Order Logic. CoRR Anuj Dawar, Abhisekh Sankaran
2020	J	`jnl`	Game Comonads & Generalised Quantifiers. CoRR Adam Ó Conghaile, Anuj Dawar
2020	J	`jnl`	MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width. CoRR Anuj Dawar, Abhisekh Sankaran
2020	—	`conf`	Relativization of Gurevich's Conjectures. Fields of Logic and Computation III Anatole Dahan, Anuj Dawar
2020	J	`jnl`	Relativization of Gurevich's Conjectures. CoRR Anatole Dahan, Anuj Dawar
2020	A*	`conf`	Symmetric Arithmetic Circuits. ICALP Anuj Dawar, Gregory Wilsenach
2020	J	`jnl`	Symmetric Arithmetic Circuits. CoRR Anuj Dawar, Gregory Wilsenach
2020	B	`conf`	Symmetric Computation (Invited Talk). CSL Anuj Dawar
2019	A*	`conf`	Approximations of Isomorphism and Logics with Linear-Algebraic Operators. ICALP Anuj Dawar, Erich Grädel, Wied Pakusa
2019	J	`jnl`	Approximations of Isomorphism and Logics with Linear-Algebraic Operators. CoRR Anuj Dawar, Erich Grädel, Wied Pakusa
2019	J	`jnl`	Constructing Hard Examples for Graph Isomorphism. J. Graph Algorithms Appl. Anuj Dawar, Kashif Khan
2019	J	`jnl`	Definable inapproximability: new challenges for duplicator. J. Log. Comput. Albert Atserias, Anuj Dawar
2019	J	`jnl`	Descriptive complexity of graph spectra. Ann. Pure Appl. Log. Anuj Dawar, Simone Severini, Octavio Zapata
2019	J	`jnl`	Generalizations of k-Weisfeiler-Leman partitions and related graph invariants. CoRR Anuj Dawar, Danny Vagnozzi
2019	J	`jnl`	Logical properties of random graphs from small addable classes. Log. Methods Comput. Sci. Anuj Dawar, Eryk Kopczynski
2019	A*	`conf`	On the Power of Symmetric Linear Programs. LICS Albert Atserias, Anuj Dawar, Joanna Ochremiak
2019	J	`jnl`	On the Power of Symmetric Linear Programs. CoRR Albert Atserias, Anuj Dawar, Joanna Ochremiak
2018	J	`jnl`	Constructing Hard Examples for Graph Isomorphism. CoRR Anuj Dawar, Kashif Khan
2018	B	`conf`	Definable Inapproximability: New Challenges for Duplicator. CSL Albert Atserias, Anuj Dawar
2018	J	`jnl`	Definable Inapproximability: New Challenges for Duplicator. CoRR Albert Atserias, Anuj Dawar
2018	A*	`ed.`	Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018 LICS Anuj Dawar, Erich Grädel
2018	B	`conf`	Symmetric Circuits for Rank Logic. CSL Anuj Dawar, Gregory Wilsenach
2018	J	`jnl`	Symmetric Circuits for Rank Logic. CoRR Anuj Dawar, Gregory Wilsenach
2017	J	`jnl`	Bounded degree and planar spectra. Log. Methods Comput. Sci. Anuj Dawar, Eryk Kopczynski
2017	J	`jnl`	Decidable Fragments of the Simple Theory of Types with Infinity and NF. Notre Dame J. Formal Log. Anuj Dawar, Thomas Forster, Zachiri McKenzie
2017	A*	`conf`	Definability of semidefinite programming and lasserre lower bounds for CSPs. LICS Anuj Dawar, Pengming Wang
2017	A*	`conf`	Definability of summation problems for Abelian groups and semigroups. LICS Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa
2017	J	`jnl`	Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361). Dagstuhl Reports Anuj Dawar, Erich Grädel, Phokion G. Kolaitis, Thomas Schwentick
2017	J	`jnl`	Fixed-Parameter Tractable Distances to Sparse Graph Classes. Algorithmica Jannis Bulian, Anuj Dawar
2017	J	`jnl`	Logical properties of random graphs from small addable classes. CoRR Anuj Dawar, Eryk Kopczynski
2017	J	`jnl`	On Symmetric Circuits and Fixed-Point Logics. Theory Comput. Syst. Matthew Anderson, Anuj Dawar
2017	J	`jnl`	Pebble Games and Cospectral Graphs. Electron. Notes Discret. Math. Anuj Dawar, Simone Severini, Octavio Zapata
2017	J	`jnl`	Pebble Games with Algebraic Rules. Fundam. Informaticae Anuj Dawar, Bjarki Holm
2017	B	`conf`	The Ackermann Award 2017. CSL Anuj Dawar, Daniel Leivant
2017	A*	`conf`	The pebbling comonad in Finite Model Theory. LICS Samson Abramsky, Anuj Dawar, Pengming Wang
2017	J	`jnl`	The pebbling comonad in finite model theory. CoRR Samson Abramsky, Anuj Dawar, Pengming Wang
2016	J	`jnl`	Bounded degree and planar spectra. CoRR Anuj Dawar, Eryk Kopczynski
2016	C	`conf`	Descriptive Complexity of Graph Spectra. WoLLIC Anuj Dawar, Simone Severini, Octavio Zapata
2016	J	`jnl`	Descriptive complexity of graph spectra. CoRR Anuj Dawar, Simone Severini, Octavio Zapata
2016	J	`jnl`	Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. Algorithmica Jannis Bulian, Anuj Dawar
2016	J	`jnl`	Lasserre Lower Bounds and Definability of Semidefinite Programming. CoRR Anuj Dawar, Pengming Wang
2016	J	`jnl`	Report on The Graph Isomorphism Problem. Bull. EATCS Anuj Dawar
2016	B	`conf`	The Ackermann Award 2016. CSL Thierry Coquand, Anuj Dawar
2015	B	`conf`	A Definability Dichotomy for Finite Valued CSPs. CSL Anuj Dawar, Pengming Wang
2015	J	`jnl`	A Definability Dichotomy for Finite Valued CSPs. CoRR Anuj Dawar, Pengming Wang
2015	—	`conf`	Capturing MSO with One Quantifier. Fields of Logic and Computation II Anuj Dawar, Luc Segoufin
2015	B	`conf`	Fixed-parameter Tractable Distances to Sparse Graph Classes. IPEC Jannis Bulian, Anuj Dawar
2015	J	`jnl`	Fixed-parameter Tractable Distances to Sparse Graph Classes. CoRR Jannis Bulian, Anuj Dawar
2015	—	`conf`	On Symmetric and Choiceless Computation. TTCS Anuj Dawar
2015	J	`jnl`	Solving Linear Programs without Breaking Abstractions. J. ACM Matthew Anderson, Anuj Dawar, Bjarki Holm
2015	B	`conf`	The Ackermann Award 2015. CSL Anuj Dawar, Dexter Kozen, Simona Ronchi Della Rocca
2015	J	`jnl`	The Graph Isomorphism Problem (Dagstuhl Seminar 15511). Dagstuhl Reports László Babai, Anuj Dawar, Pascal Schweitzer, Jacobo Torán
2015	J	`jnl`	The nature and power of fixed-point logic with counting. ACM SIGLOG News Anuj Dawar
2014	J	`jnl`	Degree lower bounds of tower-type for approximating formulas with parity quantifiers. ACM Trans. Comput. Log. Albert Atserias, Anuj Dawar
2014	J	`jnl`	Editor's foreword: WoLLIC 2010. J. Comput. Syst. Sci. Anuj Dawar, Ruy J. G. B. de Queiroz
2014	B	`conf`	Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. IPEC Jannis Bulian, Anuj Dawar
2014	J	`jnl`	Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. CoRR Jannis Bulian, Anuj Dawar
2014	A	`conf`	On Symmetric Circuits and Fixed-Point Logics. STACS Matthew Anderson, Anuj Dawar
2014	J	`jnl`	On Symmetric Circuits and Fixed-Point Logics. CoRR Matthew Anderson, Anuj Dawar
2014	—	`conf`	The Ackermann award 2014. CSL-LICS Anuj Dawar
2014	J	`jnl`	Turing Centenary Conference: How the World Computes. Ann. Pure Appl. Log. S. Barry Cooper, Anuj Dawar, Martin Hyland, Benedikt Löwe
2013	J	`jnl`	Definability of linear equation systems over groups and rings Log. Methods Comput. Sci. Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa
2013	J	`jnl`	Maximum Matching and Linear Programming in Fixed-Point Logic with Counting CoRR Matthew Anderson, Anuj Dawar, Bjarki Holm
2013	A*	`conf`	Maximum Matching and Linear Programming in Fixed-Point Logic with Counting. LICS Matthew Anderson, Anuj Dawar, Bjarki Holm
2013	B	`conf`	The Ackermann Award 2013. CSL Anuj Dawar, Thomas A. Henzinger, Damian Niwinski
2012	B	`conf`	Definability of linear equation systems over groups and rings. CSL Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa
2012	—	`conf`	Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. ICALP (2) Albert Atserias, Anuj Dawar
2012	J	`jnl`	Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. Electron. Colloquium Comput. Complex. Albert Atserias, Anuj Dawar
2012	C	`ed.`	How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings CiE S. Barry Cooper, Anuj Dawar, Benedikt Löwe
2012	B	`conf`	On Tractable Parameterizations of Graph Isomorphism. IPEC Adam Bouland, Anuj Dawar, Eryk Kopczynski
2012	—	`conf`	Pebble Games with Algebraic Rules. ICALP (2) Anuj Dawar, Bjarki Holm
2012	J	`jnl`	Pebble games with algebraic rules CoRR Anuj Dawar, Bjarki Holm
2012	B	`conf`	The Ackermann Award 2012. CSL Thierry Coquand, Anuj Dawar, Damian Niwinski
2012	J	`jnl`	The dag-width of directed graphs. J. Comb. Theory B Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek
2010	B	`ed.`	Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings CSL Anuj Dawar, Helmut Veith
2010	J	`jnl`	Homomorphism preservation on quasi-wide classes. J. Comput. Syst. Sci. Anuj Dawar
2010	C	`ed.`	Logic, Language, Information and Computation, 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010. Proceedings WoLLIC Anuj Dawar, Ruy J. G. B. de Queiroz
2010	—	`conf`	On Complete Problems, Relativizations and Logics for Complexity Classes. Fields of Logic and Computation Anuj Dawar
2010	J	`jnl`	Properties of Almost All Graphs and Generalized Quantifiers. Fundam. Informaticae Anuj Dawar, Erich Grädel
2010	B	`conf`	The Complexity of Satisfaction on Sparse Graphs. IPEC Anuj Dawar
2009	J	`jnl`	Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. Albert Atserias, Andrei A. Bulatov, Anuj Dawar
2009	J	`jnl`	Domination Problems in Nowhere-Dense Classes of Graphs CoRR Anuj Dawar, Stephan Kreutzer
2009	—	`conf`	Domination Problems in Nowhere-Dense Classes. FSTTCS Anuj Dawar, Stephan Kreutzer
2009	A*	`conf`	Logics with Rank Operators. LICS Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner
2009	J	`jnl`	Modal characterisation theorems over special classes of frames. Ann. Pure Appl. Log. Anuj Dawar, Martin Otto
2009	B	`conf`	Parameterized Complexity Classes under Logical Reductions. MFCS Anuj Dawar, Yuguo He
2009	J	`jnl`	Parameterized Complexity of First-Order Logic. Electron. Colloquium Comput. Complex. Stephan Kreutzer, Anuj Dawar
2009	B	`conf`	Separating Graph Logic from MSO. FoSSaCS Timos Antonopoulos, Anuj Dawar
2009	—	`conf`	Structure and Specification as Sources of Complexity. FSTTCS Anuj Dawar
2008	J	`jnl`	Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs. Ann. Pure Appl. Log. Anuj Dawar, David Richerby, Benjamin Rossman
2008	J	`jnl`	Homomorphism Preservation on Quasi-Wide Classes CoRR Anuj Dawar
2008	—	`conf`	On Datalog vs. LFP. ICALP (2) Anuj Dawar, Stephan Kreutzer
2008	C	`conf`	On the Descriptive Complexity of Linear Algebra. WoLLIC Anuj Dawar
2008	J	`jnl`	Preservation under Extensions on Well-Behaved Finite Structures. SIAM J. Comput. Albert Atserias, Anuj Dawar, Martin Grohe
2008	B	`conf`	The Descriptive Complexity of Parity Games. CSL Anuj Dawar, Erich Grädel
2007	A*	`conf`	Affine Systems of Equations and Counting Infinitary Logic. ICALP Albert Atserias, Andrei A. Bulatov, Anuj Dawar
2007	J	`jnl`	Expressiveness and complexity of graph logic. Inf. Comput. Anuj Dawar, Philippa Gardner, Giorgio Ghelli
2007	B	`conf`	Finite Model Theory on Tame Classes of Structures. MFCS Anuj Dawar
2007	J	`jnl`	Generalising automaticity to modal properties of finite structures. Theor. Comput. Sci. Anuj Dawar, Stephan Kreutzer
2007	A*	`conf`	Locally Excluding a Minor. LICS Anuj Dawar, Martin Grohe, Stephan Kreutzer
2007	A*	`conf`	Model Theory Makes Formulas Large. ICALP Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
2007	B	`conf`	Model-Checking First-Order Logic: Automata and Locality. CSL Anuj Dawar
2007	B	`conf`	The Power of Counting Logics on Restricted Classes of Finite Structures. CSL Anuj Dawar, David Richerby
2007	J	`jnl`	The monadic theory of finite representations of infinite words. Inf. Process. Lett. Anuj Dawar, David Janin
2006	A*	`conf`	Approximation Schemes for First-Order Definable Optimisation Problems. LICS Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt
2006	J	`jnl`	Backtracking games and inflationary fixed points. Theor. Comput. Sci. Anuj Dawar, Erich Grädel, Stephan Kreutzer
2006	A	`conf`	DAG-Width and Parity Games. STACS Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer
2006	J	`jnl`	On preservation under homomorphisms and unions of conjunctive queries. J. ACM Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
2005	C	`conf`	Choiceless Polynomial Time, Counting and the Cai-Fürer-Immerman Graphs: (Extended Abstract). WoLLIC Anuj Dawar, David Richerby, Benjamin Rossman
2005	B	`conf`	Complexity Bounds for Regular Games. MFCS Paul Hunter, Anuj Dawar
2005	—	`conf`	How Many First-order Variables are Needed on Finite Ordered Structures? We Will Show Them! (1) Anuj Dawar
2005	A*	`conf`	Modal Characterisation Theorems over Special Classes of Frames. LICS Anuj Dawar, Martin Otto
2005	A*	`conf`	Preservation Under Extensions on Well-Behaved Finite Structures. ICALP Albert Atserias, Anuj Dawar, Martin Grohe
2004	—	`conf`	Adjunct Elimination Through Games in Static Ambient Logic. FSTTCS Anuj Dawar, Philippa Gardner, Giorgio Ghelli
2004	A*	`conf`	Backtracking Games and Inflationary Fixed Points. ICALP Anuj Dawar, Erich Grädel, Stephan Kreutzer
2004	J	`jnl`	Inflationary fixed points in modal logic. ACM Trans. Comput. Log. Anuj Dawar, Erich Grädel, Stephan Kreutzer
2004	A*	`conf`	On Preservation under Homomorphisms and Unions of Conjunctive Queries. PODS Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
2004	—	`conf`	On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. FSTTCS Anuj Dawar, David Janin
2003	B	`conf`	A Fixed-Point Logic with Symmetric Choice. CSL Anuj Dawar, David Richerby
2003	J	`jnl`	Fixed-point Logics with Nondeterministic Choice. J. Log. Comput. Anuj Dawar, David Richerby
2003	—	`conf`	Foreword. ICC@LICS Anuj Dawar
2003	J	`jnl`	Guest editorial. Inf. Comput. Anuj Dawar, Daniel Leivant
2003	—	`ed.`	Proceedings of the Fifth International Workshop on Implicit Computational Complexity, ICC@LICS 2003, Ottawa, Canada, June 26-27, 2003 ICC@LICS Anuj Dawar
2002	J	`jnl`	Fixed point logics. Bull. Symb. Log. Anuj Dawar, Yuri Gurevich
2002	—	`conf`	Generalising Automaticity to Modal Properties of Finite Structures. FSTTCS Anuj Dawar, Stephan Kreutzer
2001	B	`conf`	Inflationary Fixed Points in Modal Logic. CSL Anuj Dawar, Erich Grädel, Stephan Kreutzer
1998	J	`jnl`	A Restricted Second Order Logic for Finite Structures. Inf. Comput. Anuj Dawar
1998	J	`jnl`	Capturing Relativized Complexity Classes without Order. Math. Log. Q. Anuj Dawar, Georg Gottlob, Lauri Hella
1998	J	`jnl`	Elementary Properties of the Finite Ranks. Math. Log. Q. Anuj Dawar, Kees Doets, Steven Lindell, Scott Weinstein
1998	A*	`conf`	Ordering Finite Variable Types with Generalized Quantifiers. LICS Anuj Dawar, Lauri Hella, Anil Seth
1995	B	`conf`	First Order Logic, Fixed Point Logic and Linear Order. CSL Anuj Dawar, Steven Lindell, Scott Weinstein
1995	A*	`conf`	Generalized Quantifiers and 0-1 Laws LICS Anuj Dawar, Erich Grädel
1995	J	`jnl`	Generalized Quantifiers and Logical Reducibilities. J. Log. Comput. Anuj Dawar
1995	A*	`conf`	Implicit Definability and Infinitary Logic in Finite Model Theory. ICALP Anuj Dawar, Lauri Hella, Phokion G. Kolaitis
1995	J	`jnl`	Infinitary Logic and Inductive Definability over Finite Structures Inf. Comput. Anuj Dawar, Steven Lindell, Scott Weinstein
1995	J	`jnl`	The expressive Power of Finitely Many Generalized Quantifiers. Inf. Comput. Anuj Dawar, Lauri Hella
1995	—	`conf`	Types and Indiscernibles in Finite Models. Logic Colloquium Anuj Dawar
1994	—	`conf`	A Restricted Second Order Logic for Finite Structures. LCC Anuj Dawar
1994	A*	`conf`	The Expressive Power of Finitely Many Generalized Quantifiers LICS Anuj Dawar, Lauri Hella
1990	J	`jnl`	An Interpretation of Negation in Feature Structure Descriptions. Comput. Linguistics Anuj Dawar, K. Vijay-Shanker
1989	A*	`conf`	A Three-Valued Interpretation of Negation in Feature Structure Descriptions. ACL Anuj Dawar, K. Vijay-Shanker