Conference:
(with D. Kuske and M. Lohrey) The Isomorphism Problem on \omega-Automatic Trees,
in Proceedings of CSL'10, Brno, Czech,2010 (download)
(with D. Kuske and M. Lohrey) The Isomorphism Problem on Classes of Automatic
Structures, in Proceedings of LICS'10, Edinburgh, UK, 2010. (download)
(with B. Khoussainov and I. Khaliq) A Dynamic Algorithm for Reachability
Games Played on Trees, in Proceedings of MFCS'09, High Tatras, Slovakia,
2009.
(with M. Minnes) Analyzing Complexity in Classes of Unary Automatic
Structures, in Proceedings of LATA09', Tarragona, Spain, 2009
(with T. Zhang) Combining Dense Linear
Orders with the Random Graph, in Proceedings of CEDAR'08, Sydney, Australia
(with B. Csima and B. Khoussainov)
Computable Categoricity of Graphs with Finite Components, in Proceedings of
CiE'08, Athens, Greece,2008(download)
(with B. Khoussainov and M. Minnes)
Unary Automatic Graph: An Algorithmic Perspective . in Proceedings of
TAMC'08, Xi'an, China, 2008 (download)
(with B. Khoussainov) On Complexity of
Ehrenfeucht-Fraisse Games, in Proceedings of LFCS07', New York, 2007 (download)
Journals:
(with M. Lohrey and D. Kuske) The Isomorphism Problem On Classes of Automatic
Structures with Transitive Relations. In preparation
(with B. Khoussainov and M. Minnes) Unary Automatic Graph: An Algorithmic
Perspective. in the Journal of Mathematical Structures in Computer Science,
19:133-152, Cambridge University Press, 2009. (download)
(with B. Khoussainov) On Complexity of Ehrenfeucht-Fraisse Games, Annals
of Pure and Applied Logic, 2009. (Link)
Thesis:
A Journey from Finite to Automatic Structures and Beyond. PhD Thesis. University
of Auckland, New Zealand, 2010. (download)