E-LIB Suche - Ergebnisse für: Dawar, Anuj

1

International Colloquium on Automata, Languages and Program..:

Dawar, Anuj
Theory of Computing Systems. , 2024

Link: https://doi.org/10.1007/..

2

A Logic for P: Are we Nearly There Yet?:

Dawar, Anuj ; Pago, Benedikt
ACM SIGLOG News. 11 (2024) 2 - p. 35-60 , 2024

Link: https://doi.org/10.1145/..

3

Corrigendum to "Homomorphism preservation on quasi-wide cla..:

Dawar, Anuj
Journal of Computer and System Sciences. 145 (2024) - p. 103553 , 2024

Link: https://doi.org/10.1016/..

4

Quantifiers Closed Under Partial Polymorphisms:

Dawar, Anuj ; Hella, Lauri
Is Part Of LIPIcs, Volume 288, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). , 2024

Link: https://doi.org/10.4230/..

5

Quantifiers Closed Under Partial Polymorphisms:

Dawar, Anuj ; Hella, Lauri
32nd EACSL Annual Conference on Computer Science Logic, CSL 2024. , 2024

Link: https://trepo.tuni.fi/ha..

6

Limits of Symmetric Computation (Invited Talk):

Dawar, Anuj
Is Part Of LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). , 2024

Link: https://doi.org/10.4230/..

7

Limitations of choiceless computation

Aachen, RWTH Aachen University, 2023

Pago, Benedikt , 2023

Link: https://nbn-resolving.de..

8

MSO undecidability for hereditary classes of unbounded cliq..:

Dawar, Anuj ; Sankaran, Abhisekh
European Journal of Combinatorics. , 2023

Link: https://doi.org/10.1016/..

9

Descriptive complexity of controllable graphs:

Abiad, Aida ; Dawar, Anuj ; Zapata, Octavio
Procedia Computer Science. 223 (2023) - p. 20-27 , 2023

Link: https://doi.org/10.1016/..

10

Constraint Satisfaction, Graph Isomorphism, and the Pebblin..:

, In: Samson Abramsky on Logic and Structure in Computer Science and Beyond; Outstanding Contributions to Logic,

Dawar, Anuj - p. 671-699 , 2023

Link: https://doi.org/10.1007/..

11

Symmetric Arithmetic Circuits:

Dawar, Anuj ; Wilsenach, Gregory
https://www.repository.cam.ac.uk/handle/1810/354281. , 2023

Link: https://www.repository.c..

12

Descriptive complexity of controllable graphs:

Abiad, Aida ; Dawar, Anuj ; Zapata, Octavio
http://arxiv.org/abs/2309.04892. , 2023

Link: http://arxiv.org/abs/230..

13

Descriptive complexity of controllable graphs:

Abiad, Aida ; Dawar, Anuj ; Zapata, Octavio
https://research.tue.nl/en/publications/bdbce695-8486-4a39-a13f-ba5feda1800f. , 2023

Link: https://research.tue.nl/..

14

Quantifiers closed under partial polymorphisms:

Dawar, Anuj ; Hella, Lauri
http://arxiv.org/abs/2308.03695. , 2023

Link: http://arxiv.org/abs/230..

15

Monadic NIP in monotone classes of relational structures:

Braunfeld, Samuel ; Dawar, Anuj ; Eleftheriadis, Ioannis.
http://journals.muni.cz/eurocomb/article/view/35563/31436. , 2023

Link: http://journals.muni.cz/..