No. Title Author Year
1 Lower Bounds for Symmetric Circuits for the Determinant Dawar, Anuj et al. 2022
2 Extension Preservation in the Finite and Prefix Classes of First Order Logic Dawar, Anuj et al. 2021
3 Game Comonads & Generalised Quantifiers Conghaile, Adam Ó et al. 2021
4 On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism Dawar, Anuj et al. 2021
5 Front Matter, Table of Contents, Preface, Conference Organization Czumaj, Artur et al. 2020
6 LIPIcs, Volume 168, ICALP 2020, Complete Volume Czumaj, Artur et al. 2020
7 Symmetric Arithmetic Circuits Dawar, Anuj et al. 2020
8 Symmetric Computation (Invited Talk) Dawar, Anuj 2020
9 Approximations of Isomorphism and Logics with Linear-Algebraic Operators Dawar, Anuj et al. 2019
10 Definable Inapproximability: New Challenges for Duplicator Atserias, Albert et al. 2018
11 Finite and Algorithmic Model Theory (Dagstuhl Seminar 17361) Dawar, Anuj et al. 2018
12 Symmetric Circuits for Rank Logic Dawar, Anuj et al. 2018
13 The Ackermann Award 2017 Dawar, Anuj et al. 2017
14 The Ackermann Award 2016 Coquand, Thierry et al. 2016
15 The Graph Isomorphism Problem (Dagstuhl Seminar 15511) Babai, László et al. 2016
16 A Definability Dichotomy for Finite Valued CSPs Dawar, Anuj et al. 2015
17 Fixed-parameter Tractable Distances to Sparse Graph Classes Bulian, Jannis et al. 2015
18 The Ackermann Award 2015 Dawar, Anuj et al. 2015
19 On Symmetric Circuits and Fixed-Point Logics Anderson, Matthew et al. 2014
20 The Ackermann Award 2013 Dawar, Anuj et al. 2013
21 Definability of linear equation systems over groups and rings Dawar, Anuj et al. 2012
22 The Ackermann Award 2012 Coquand, Thierry et al. 2012
23 Domination Problems in Nowhere-Dense Classes Dawar, Anuj et al. 2009
24 Structure and Specification as Sources of Complexity Dawar, Anuj 2009
Current Page :
Number of result pages: 1
Number of documents: 24


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