No. Title Author Year
1 Symmetric Computation (Invited Talk) Dawar, Anuj 2020
2 Approximations of Isomorphism and Logics with Linear-Algebraic Operators Dawar, Anuj et al. 2019
3 Definable Inapproximability: New Challenges for Duplicator Atserias, Albert et al. 2018
4 Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361) Dawar, Anuj et al. 2018
5 Symmetric Circuits for Rank Logic Dawar, Anuj et al. 2018
6 The Ackermann Award 2017 Dawar, Anuj et al. 2017
7 The Ackermann Award 2016 Coquand, Thierry et al. 2016
8 The Graph Isomorphism Problem (Dagstuhl Seminar 15511) Babai, László et al. 2016
9 A Definability Dichotomy for Finite Valued CSPs Dawar, Anuj et al. 2015
10 Fixed-parameter Tractable Distances to Sparse Graph Classes Bulian, Jannis et al. 2015
11 The Ackermann Award 2015 Dawar, Anuj et al. 2015
12 On Symmetric Circuits and Fixed-Point Logics Anderson, Matthew et al. 2014
13 The Ackermann Award 2013 Dawar, Anuj et al. 2013
14 Definability of linear equation systems over groups and rings Dawar, Anuj et al. 2012
15 The Ackermann Award 2012 Coquand, Thierry et al. 2012
16 Domination Problems in Nowhere-Dense Classes Dawar, Anuj et al. 2009
17 Structure and Specification as Sources of Complexity Dawar, Anuj 2009
Current Page :
Number of result pages: 1
Number of documents: 17


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI