2017

• F. Abu Zaid, A. Dawar, E. Grädel, and W. Pakusa. Definability of Summation Problems for Abelian Groups and Semigroups. In Proceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2017.             
  BibTeX

  @inproceedings{AbuDawGraPak17,
       author = {Faried {Abu Zaid} and Anuj Dawar and Erich Gr{\"a}del and Wied Pakusa},
       title = {{Definability of Summation Problems for Abelian Groups and Semigroups}},
       url = {http://www.logic.rwth-aachen.de/pub/graedel/AbuzaidDawGraPak17.pdf},
       booktitle = {{Proceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)}},
       year = {2017},
  }
  

• F. Abu Zaid, E. Grädel, and F. Reinhardt. Advice Automatic Structures and Uniformly Automatic Classes. In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), 2017.             
  BibTeX

  @inproceedings{AbuGraRei17,
       author = {Faried {Abu Zaid} and Erich Gr{\"a}del and Frederic Reinhardt},
       title = {{Advice Automatic Structures and Uniformly Automatic Classes}},
       url = {http://www.logic.rwth-aachen.de/pub/abuzaid/AbuGraRei17.pdf},
       booktitle = {{26th EACSL Annual Conference on Computer Science Logic (CSL 2017)}},
       year = {2017},
  }
  

2016

• F. Abu Zaid. Algorithmic Solutions via Model Theoretic Interpretations. PhD thesis, RWTH Aachen University, 2016.             
  BibTeX

  @phdthesis{Abuzaid16,
       author = {Faried {Abu Zaid}},
       school = {{RWTH} Aachen University},
       title = {Algorithmic Solutions via Model Theoretic Interpretations},
       url = {https://logic.rwth-aachen.de/pub/abuzaid/diss.pdf},
       year = {2016},
  }
  

2014

• F. Abu Zaid, E. Grädel, M. Grohe, and W. Pakusa. Choiceless Polynomial Time on structures with small Abelian colour classes. In Mathematical Foundations of Computer Science 2014, vol. 8634 of Lecture Notes in Computer Science, pp. 50-62. Springer, 2014.             
  BibTeX

  @incollection{AGGP14,
       author = {Faried {Abu Zaid} and Erich Gr{\"a}del and Martin Grohe and Wied Pakusa},
       title = {{Choiceless Polynomial Time on structures with small Abelian colour classes}},
       url = {http://logic.rwth-aachen.de/pub/pakusa/cptcan.pdf},
       year = {2014},
       booktitle = {Mathematical Foundations of Computer Science 2014},
       volume = {8634},
       series = {Lecture Notes in Computer Science},
       publisher = {Springer},
       pages = {50-62},
  }
  

• F. Abu Zaid, E. Grädel, and S. Jaax. Bisimulation Safe Fixed Point Logic. Advances in Modal Logic, Volume 10, 2014.             
  BibTeX

  @article{AGJ14,
       author = {Faried {Abu Zaid} and Erich Gr{\"a}del and Stefan Jaax},
       title = {Bisimulation Safe Fixed Point Logic},
       journal = {Advances in Modal Logic, Volume 10},
       url = {http://logic.rwth-aachen.de/pub/abuzaid/aiml14.pdf},
       year = {2014},
  }
  

2013

• F. Abu Zaid, E. Grädel, Ł. Kaiser, and W. Pakusa. Model-Theoretic Properties of omega-Automatic Structures. Theory of Computing Systems, Special Issue dedicated to STACS 2012, 2013.             
  BibTeX

  @article{AGKP12,
       author = {Faried {Abu Zaid} and Erich Gr{\"a}del and \L{}ukasz Kaiser and Wied Pakusa},
       title = {Model-Theoretic Properties of omega-Automatic Structures},
       journal = {Theory of Computing Systems, Special Issue dedicated to STACS 2012},
       url = {http://www.logic.rwth-aachen.de/pub/abuzaid/modelprop.pdf},
       note = {published online 17 October 2013},
       doi = {http://dx.doi.org/10.1007/s00224-013-9508-6},
       year = {2013},
  }
  

2012

• F. Abu Zaid, E. Grädel, and Ł. Kaiser. The Field of Reals is not omega-Automatic. In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012 (C. Dürr and T. Wilke, Eds.), 2012.                                 
  Abstract   BibTeX

  We investigate structural properties of omega-automatic presentations of infinite structures in order to sharpen our methods to determine whether a given structure is omega-automatic. We apply these methods to show that no field of characteristic 0 admits an injective omega-automatic presentation, and that uncountable fields with a definable linear order cannot be omega-automatic.

  @inproceedings{AGK12,
       author = {Faried {Abu Zaid} and Erich Gr{\"a}del and {\L}ukasz Kaiser},
       booktitle = {{Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, STACS~2012}},
       editor = {Christoph D{\"u}rr and Thomas Wilke},
       isbn = {978-3-939897-35-4},
       title = {{The Field of Reals is not omega-Automatic}},
       url = {http://www.logic.rwth-aachen.de/pub/abuzaid/reals_not_automatic.pdf},
       year = {2012},
  }
  

2011

• F. Abu Zaid. Definability in ω-Automatic Structures. Diploma thesis, RWTH-Aachen, 2011.             
  BibTeX

  @misc{AbuZaid08,
       author = {Faried {Abu Zaid}},
       howpublished = {Diploma thesis, RWTH-Aachen},
       title = {{Definability in $\omega$-Automatic Structures}},
       url = {http://logic.rwth-aachen.de/~abuzaid/diplomarbeit.pdf},
       year = {2011},
  }