( en | de | ru )

 

Disambiguation of "Dawar, Anuj"

Author of the publication

copydeleteadd this publication to your clipboard
Capturing Relativized Complexity Classes without Order.

, , and . Math. Log. Q., (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anuj Dawar

Heider Dawar

Anuj Pathania

Anuj Rawat

Parwiz Dawarpanah

 

Other publications of authors with the same name

Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree., and . IPEC, volume 8894 of Lecture Notes in Computer Science, page 135-146. Springer, (2014)Definable Inapproximability: New Challenges for Duplicator., and . CSL, volume 119 of LIPIcs, page 7:1-7:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Ackermann Award 2012., , and . CSL, volume 16 of LIPIcs, page 1-5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Symmetric Computation (Invited Talk).. CSL, volume 152 of LIPIcs, page 2:1-2:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Modal characterisation theorems over special classes of frames., and . Ann. Pure Appl. Log., 161 (1): 1-42 (2009)Types and Indiscernibles in Finite Models.. Logic Colloquium, volume 11 of Lecture Notes in Logic, page 51-65. Springer, (1995)Model-Checking First-Order Logic: Automata and Locality.. CSL, volume 4646 of Lecture Notes in Computer Science, page 6. Springer, (2007)Finite Model Theory on Tame Classes of Structures.. MFCS, volume 4708 of Lecture Notes in Computer Science, page 2-12. Springer, (2007)An Interpretation of Negation in Feature Structure Descriptions., and . Computational Linguistics, 16 (1): 11-21 (1990)The Graph Isomorphism Problem (Dagstuhl Seminar 15511)., , , and . Dagstuhl Reports, 5 (12): 1-17 (2015)