default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnuj Dawar
Person information
- affiliation: University of Cambridge, UK
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j48]Anuj Dawar:
Corrigendum to "Homomorphism preservation on quasi-wide classes" [J. Comput. Syst. Sci. 76 (5) (2010) 324-332]. J. Comput. Syst. Sci. 145: 103553 (2024)- [j47]Adam Ó Conghaile
, Anuj Dawar:
Game Comonads & Generalised Quantifiers. Log. Methods Comput. Sci. 20(3) (2024) - [j46]Anuj Dawar:
International Colloquium on Automata, Languages and Programming (ICALP 2020). Theory Comput. Syst. 68(4): 591-592 (2024) - [j45]Anuj Dawar, Benedikt Pago:
A Logic for P: Are we Nearly There Yet? ACM SIGLOG News 11(2): 35-60 (2024) - [c80]Anuj Dawar, Lauri Hella:
Quantifiers Closed Under Partial Polymorphisms. CSL 2024: 23:1-23:19 - [c79]Anuj Dawar:
Limits of Symmetric Computation (Invited Talk). ICALP 2024: 1:1-1:8 - [c78]Anuj Dawar, Ioannis Eleftheriadis:
Preservation Theorems on Sparse Classes Revisited. MFCS 2024: 47:1-47:16 - [i39]Anuj Dawar, Ioannis Eleftheriadis:
Preservation theorems on sparse classes revisited. CoRR abs/2405.10887 (2024) - [i38]Anuj Dawar:
Homomorphism Counts to Trees. CoRR abs/2405.19147 (2024) - 2023
- [j44]Anuj Dawar, Erich Grädel, Moritz Lichter:
Limitations of the invertible-map equivalences. J. Log. Comput. 33(5): 961-969 (2023) - [c77]Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos:
Monadic NIP in Monotone Classes of Relational Structures. ICALP 2023: 119:1-119:18 - [c76]Aida Abiad, Anuj Dawar, Octavio Zapata:
Descriptive complexity of controllable graphs. LAGOS 2023: 20-27 - [e8]Petra Berenbrink, Patricia Bouyer, Anuj Dawar, Mamadou Moustapha Kanté:
40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023, March 7-9, 2023, Hamburg, Germany. LIPIcs 254, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-266-2 [contents] - [i37]Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos:
Monadic NIP in monotone classes of relational structures. CoRR abs/2302.05695 (2023) - [i36]Anuj Dawar, Lauri Hella:
Quantifiers closed under partial polymorphisms. CoRR abs/2308.03695 (2023) - [i35]Aida Abiad, Anuj Dawar, Octavio Zapata:
Descriptive complexity of controllable graphs. CoRR abs/2309.04892 (2023) - 2022
- [j43]Anuj Dawar, Gregory Wilsenach:
Symmetric Circuits for Rank Logic. ACM Trans. Comput. Log. 23(1): 6:1-6:35 (2022) - [c75]Anuj Dawar, Abhisekh Sankaran:
MSO Undecidability for Hereditary Classes of Unbounded Clique Width. CSL 2022: 17:1-17:17 - [c74]Anuj Dawar, Gregory Wilsenach:
Lower Bounds for Symmetric Circuits for the Determinant. ITCS 2022: 52:1-52:22 - [c73]Anuj Dawar, Felipe Ferreira Santos:
Separating LREC from LFP. LICS 2022: 55:1-55:13 - [e7]Anuj Dawar, Venkatesan Guruswami:
42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022, December 18-20, 2022, IIT Madras, Chennai, India. LIPIcs 250, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-261-7 [contents] - [i34]Aida Abiad, Anuj Dawar, Octavio Zapata:
Descriptive complexity of the generalized spectra of graphs. CoRR abs/2210.05482 (2022) - 2021
- [j42]Albert Atserias, Anuj Dawar, Joanna Ochremiak:
On the Power of Symmetric Linear Programs. J. ACM 68(4): 26:1-26:35 (2021) - [c72]Adam Ó Conghaile, Anuj Dawar:
Game Comonads & Generalised Quantifiers. CSL 2021: 16:1-16:17 - [c71]Anuj Dawar, Abhisekh Sankaran:
Extension Preservation in the Finite and Prefix Classes of First Order Logic. CSL 2021: 18:1-18:13 - [c70]Anuj Dawar, Tomas Jakl, Luca Reggio:
Lovász-Type Theorems and Game Comonads. LICS 2021: 1-13 - [c69]Anuj Dawar, Danny Vagnozzi:
On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism. MFCS 2021: 37:1-37:16 - [i33]Anuj Dawar, Danny Vagnozzi:
On the relative power of algebraic approximations of graph isomorphism. CoRR abs/2103.16294 (2021) - [i32]Anuj Dawar, Tomas Jakl, Luca Reggio:
Lovász-Type Theorems and Game Comonads. CoRR abs/2105.03274 (2021) - [i31]Anuj Dawar, Felipe Ferreira Santos:
Separating LREC from LFP. CoRR abs/2107.05296 (2021) - [i30]Anuj Dawar, Gregory Wilsenach:
Lower Bounds for Symmetric Circuits for the Determinant. CoRR abs/2107.10986 (2021) - [i29]Anuj Dawar, Erich Grädel, Moritz Lichter:
Limitations of the Invertible-Map Equivalences. CoRR abs/2109.07218 (2021) - 2020
- [c68]Anatole Dahan, Anuj Dawar:
Relativization of Gurevich's Conjectures. Fields of Logic and Computation III 2020: 95-104 - [c67]Anuj Dawar, Erich Grädel, Matthias Hoelzel:
Convergence and Nonconvergence Laws for Random Expansions of Product Structures. Fields of Logic and Computation III 2020: 118-132 - [c66]Anuj Dawar:
Symmetric Computation (Invited Talk). CSL 2020: 2:1-2:12 - [c65]Anuj Dawar, Gregory Wilsenach:
Symmetric Arithmetic Circuits. ICALP 2020: 36:1-36:18 - [e6]Artur Czumaj, Anuj Dawar, Emanuela Merelli:
47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference). LIPIcs 168, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-138-2 [contents] - [i28]Anatole Dahan, Anuj Dawar:
Relativization of Gurevich's Conjectures. CoRR abs/2002.03725 (2020) - [i27]Anuj Dawar, Gregory Wilsenach:
Symmetric Arithmetic Circuits. CoRR abs/2002.06451 (2020) - [i26]Adam Ó Conghaile, Anuj Dawar:
Game Comonads & Generalised Quantifiers. CoRR abs/2006.16039 (2020) - [i25]Anuj Dawar, Abhisekh Sankaran:
Extension Preservation in the Finite and Prefix Classes of First Order Logic. CoRR abs/2007.05459 (2020) - [i24]Anuj Dawar, Abhisekh Sankaran:
MSO Undecidability for some Hereditary Classes of Unbounded Clique-Width. CoRR abs/2011.02894 (2020)
2010 – 2019
- 2019
- [j41]Anuj Dawar, Simone Severini, Octavio Zapata:
Descriptive complexity of graph spectra. Ann. Pure Appl. Log. 170(9): 993-1007 (2019) - [j40]Anuj Dawar, Kashif Khan:
Constructing Hard Examples for Graph Isomorphism. J. Graph Algorithms Appl. 23(2): 293-316 (2019) - [j39]Anuj Dawar, Eryk Kopczynski:
Logical properties of random graphs from small addable classes. Log. Methods Comput. Sci. 15(3) (2019) - [j38]Albert Atserias, Anuj Dawar:
Definable inapproximability: new challenges for duplicator. J. Log. Comput. 29(8): 1185-1210 (2019) - [c64]Anuj Dawar, Erich Grädel, Wied Pakusa:
Approximations of Isomorphism and Logics with Linear-Algebraic Operators. ICALP 2019: 112:1-112:14 - [c63]Albert Atserias, Anuj Dawar, Joanna Ochremiak:
On the Power of Symmetric Linear Programs. LICS 2019: 1-13 - [i23]Albert Atserias, Anuj Dawar, Joanna Ochremiak:
On the Power of Symmetric Linear Programs. CoRR abs/1901.07825 (2019) - [i22]Anuj Dawar, Erich Grädel, Wied Pakusa:
Approximations of Isomorphism and Logics with Linear-Algebraic Operators. CoRR abs/1902.06648 (2019) - [i21]Anuj Dawar, Danny Vagnozzi:
Generalizations of k-Weisfeiler-Leman partitions and related graph invariants. CoRR abs/1906.00914 (2019) - 2018
- [c62]Albert Atserias, Anuj Dawar:
Definable Inapproximability: New Challenges for Duplicator. CSL 2018: 7:1-7:21 - [c61]Anuj Dawar, Gregory Wilsenach:
Symmetric Circuits for Rank Logic. CSL 2018: 20:1-20:16 - [e5]Anuj Dawar, Erich Grädel:
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. ACM 2018 [contents] - [i20]Anuj Dawar, Gregory Wilsenach:
Symmetric Circuits for Rank Logic. CoRR abs/1804.02939 (2018) - [i19]Albert Atserias, Anuj Dawar:
Definable Inapproximability: New Challenges for Duplicator. CoRR abs/1806.11307 (2018) - [i18]Anuj Dawar, Kashif Khan:
Constructing Hard Examples for Graph Isomorphism. CoRR abs/1809.08154 (2018) - 2017
- [j37]Jannis Bulian, Anuj Dawar:
Fixed-Parameter Tractable Distances to Sparse Graph Classes. Algorithmica 79(1): 139-158 (2017) - [j36]Anuj Dawar, Simone Severini, Octavio Zapata:
Pebble Games and Cospectral Graphs. Electron. Notes Discret. Math. 61: 323-329 (2017) - [j35]Anuj Dawar, Bjarki Holm:
Pebble Games with Algebraic Rules. Fundam. Informaticae 150(3-4): 281-316 (2017) - [j34]Anuj Dawar, Eryk Kopczynski:
Bounded degree and planar spectra. Log. Methods Comput. Sci. 13(4) (2017) - [j33]Matthew Anderson, Anuj Dawar:
On Symmetric Circuits and Fixed-Point Logics. Theory Comput. Syst. 60(3): 521-551 (2017) - [j32]Anuj Dawar, Thomas Forster, Zachiri McKenzie:
Decidable Fragments of the Simple Theory of Types with Infinity and NF. Notre Dame J. Formal Log. 58(3): 433-451 (2017) - [c60]Anuj Dawar, Daniel Leivant:
The Ackermann Award 2017. CSL 2017: 1:1-1:4 - [c59]Samson Abramsky, Anuj Dawar, Pengming Wang:
The pebbling comonad in Finite Model Theory. LICS 2017: 1-12 - [c58]Anuj Dawar, Pengming Wang:
Definability of semidefinite programming and lasserre lower bounds for CSPs. LICS 2017: 1-12 - [c57]Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa:
Definability of summation problems for Abelian groups and semigroups. LICS 2017: 1-11 - [i17]Samson Abramsky, Anuj Dawar, Pengming Wang:
The pebbling comonad in finite model theory. CoRR abs/1704.05124 (2017) - [i16]Anuj Dawar, Eryk Kopczynski:
Logical properties of random graphs from small addable classes. CoRR abs/1707.02081 (2017) - [i15]Anuj Dawar, Erich Grädel, Phokion G. Kolaitis, Thomas Schwentick:
Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361). Dagstuhl Reports 7(9): 1-25 (2017) - 2016
- [j31]Jannis Bulian, Anuj Dawar:
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. Algorithmica 75(2): 363-382 (2016) - [j30]Anuj Dawar:
Report on The Graph Isomorphism Problem. Bull. EATCS 118 (2016) - [c56]Thierry Coquand, Anuj Dawar:
The Ackermann Award 2016. CSL 2016: 1:1-1:4 - [c55]Anuj Dawar, Simone Severini, Octavio Zapata:
Descriptive Complexity of Graph Spectra. WoLLIC 2016: 183-199 - [i14]Anuj Dawar, Pengming Wang:
Lasserre Lower Bounds and Definability of Semidefinite Programming. CoRR abs/1602.05409 (2016) - [i13]Anuj Dawar, Simone Severini, Octavio Zapata:
Descriptive complexity of graph spectra. CoRR abs/1603.07030 (2016) - [i12]Anuj Dawar, Eryk Kopczynski:
Bounded degree and planar spectra. CoRR abs/1609.01789 (2016) - 2015
- [j29]Matthew Anderson, Anuj Dawar, Bjarki Holm:
Solving Linear Programs without Breaking Abstractions. J. ACM 62(6): 48:1-48:26 (2015) - [j28]Anuj Dawar:
The nature and power of fixed-point logic with counting. ACM SIGLOG News 2(1): 8-21 (2015) - [c54]Anuj Dawar, Luc Segoufin:
Capturing MSO with One Quantifier. Fields of Logic and Computation II 2015: 142-152 - [c53]Anuj Dawar, Pengming Wang:
A Definability Dichotomy for Finite Valued CSPs. CSL 2015: 60-77 - [c52]Anuj Dawar, Dexter Kozen, Simona Ronchi Della Rocca:
The Ackermann Award 2015. CSL 2015: xv-xviii - [c51]Jannis Bulian, Anuj Dawar:
Fixed-parameter Tractable Distances to Sparse Graph Classes. IPEC 2015: 236-247 - [c50]Anuj Dawar:
On Symmetric and Choiceless Computation. TTCS 2015: 23-29 - [i11]Jannis Bulian, Anuj Dawar:
Fixed-parameter Tractable Distances to Sparse Graph Classes. CoRR abs/1502.05910 (2015) - [i10]Anuj Dawar, Pengming Wang:
A Definability Dichotomy for Finite Valued CSPs. CoRR abs/1504.03543 (2015) - [i9]László Babai, Anuj Dawar, Pascal Schweitzer, Jacobo Torán:
The Graph Isomorphism Problem (Dagstuhl Seminar 15511). Dagstuhl Reports 5(12): 1-17 (2015) - 2014
- [j27]S. Barry Cooper, Anuj Dawar, Martin Hyland, Benedikt Löwe:
Turing Centenary Conference: How the World Computes. Ann. Pure Appl. Log. 165(9): 1353-1354 (2014) - [j26]Anuj Dawar, Ruy J. G. B. de Queiroz:
Editor's foreword: WoLLIC 2010. J. Comput. Syst. Sci. 80(2): 321-322 (2014) - [j25]Albert Atserias, Anuj Dawar:
Degree lower bounds of tower-type for approximating formulas with parity quantifiers. ACM Trans. Comput. Log. 15(1): 6:1-6:24 (2014) - [c49]Anuj Dawar:
The Ackermann award 2014. CSL-LICS 2014: 5:1-5:3 - [c48]Jannis Bulian, Anuj Dawar:
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. IPEC 2014: 135-146 - [c47]Matthew Anderson, Anuj Dawar:
On Symmetric Circuits and Fixed-Point Logics. STACS 2014: 41-52 - [i8]Matthew Anderson, Anuj Dawar:
On Symmetric Circuits and Fixed-Point Logics. CoRR abs/1401.1125 (2014) - [i7]Jannis Bulian, Anuj Dawar:
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree. CoRR abs/1406.4718 (2014) - 2013
- [j24]Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa:
Definability of linear equation systems over groups and rings. Log. Methods Comput. Sci. 9(4) (2013) - [c46]Anuj Dawar, Thomas A. Henzinger, Damian Niwinski:
The Ackermann Award 2013. CSL 2013: 1-4 - [c45]Matthew Anderson, Anuj Dawar, Bjarki Holm:
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting. LICS 2013: 173-182 - [i6]Matthew Anderson, Anuj Dawar, Bjarki Holm:
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting. CoRR abs/1304.6870 (2013) - 2012
- [j23]Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek:
The dag-width of directed graphs. J. Comb. Theory B 102(4): 900-923 (2012) - [c44]Thierry Coquand, Anuj Dawar, Damian Niwinski:
The Ackermann Award 2012. CSL 2012: 1-5 - [c43]Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, Wied Pakusa:
Definability of linear equation systems over groups and rings. CSL 2012: 213-227 - [c42]Albert Atserias, Anuj Dawar:
Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. ICALP (2) 2012: 67-78 - [c41]Anuj Dawar, Bjarki Holm:
Pebble Games with Algebraic Rules. ICALP (2) 2012: 251-262 - [c40]Adam Bouland, Anuj Dawar, Eryk Kopczynski:
On Tractable Parameterizations of Graph Isomorphism. IPEC 2012: 218-230 - [e4]S. Barry Cooper, Anuj Dawar, Benedikt Löwe:
How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings. Lecture Notes in Computer Science 7318, Springer 2012, ISBN 978-3-642-30869-7 [contents] - [i5]Anuj Dawar, Bjarki Holm:
Pebble games with algebraic rules. CoRR abs/1205.0913 (2012) - [i4]Albert Atserias, Anuj Dawar:
Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [j22]Anuj Dawar, Erich Grädel:
Properties of Almost All Graphs and Generalized Quantifiers. Fundam. Informaticae 98(4): 351-372 (2010) - [j21]Anuj Dawar:
Homomorphism preservation on quasi-wide classes. J. Comput. Syst. Sci. 76(5): 324-332 (2010) - [c39]Anuj Dawar:
On Complete Problems, Relativizations and Logics for Complexity Classes. Fields of Logic and Computation 2010: 201-207 - [c38]Anuj Dawar:
The Complexity of Satisfaction on Sparse Graphs. IPEC 2010: 1-2 - [e3]Anuj Dawar, Helmut Veith:
Computer Science Logic, 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings. Lecture Notes in Computer Science 6247, Springer 2010, ISBN 978-3-642-15204-7 [contents] - [e2]Anuj Dawar, Ruy J. G. B. de Queiroz:
Logic, Language, Information and Computation, 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010. Proceedings. Lecture Notes in Computer Science 6188, Springer 2010, ISBN 978-3-642-13823-2 [contents]
2000 – 2009
- 2009
- [j20]Anuj Dawar, Martin Otto:
Modal characterisation theorems over special classes of frames. Ann. Pure Appl. Log. 161(1): 1-42 (2009) - [j19]Albert Atserias, Andrei A. Bulatov, Anuj Dawar:
Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. 410(18): 1666-1683 (2009) - [c37]Timos Antonopoulos, Anuj Dawar:
Separating Graph Logic from MSO. FoSSaCS 2009: 63-77 - [c36]Anuj Dawar, Stephan Kreutzer:
Domination Problems in Nowhere-Dense Classes. FSTTCS 2009: 157-168 - [c35]Anuj Dawar:
Structure and Specification as Sources of Complexity. FSTTCS 2009: 407-416 - [c34]Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Laubner:
Logics with Rank Operators. LICS 2009: 113-122 - [c33]Anuj Dawar, Yuguo He:
Parameterized Complexity Classes under Logical Reductions. MFCS 2009: 258-269 - [i3]Anuj Dawar, Stephan Kreutzer:
Domination Problems in Nowhere-Dense Classes of Graphs. CoRR abs/0907.4283 (2009) - [i2]Stephan Kreutzer, Anuj Dawar:
Parameterized Complexity of First-Order Logic. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j18]