Education and Work:
2009 Jul - 2010 Dec ---- Research Assistant at die Abteilung Algebraische
und logische Grundlagen der Informatik am Institut für Informatik, Universität
Leipzig, Leipzig, Germany
2006-Present----
Doctoral research in Computer Science, University of Auckland, Auckland, New
Zealand (Supervised by
Bakhadyr Khoussainov
and
Andre Nies)
2008 Jan - May
---- Intership at Microsoft Research Asia, Beijing, China
2007 Fall
-------Visiting PhD Student, Department of Mathematics, Cornell University, New
York, USA
2006 Spring------Visiting
Student, Department of Mathematics, National University of Singapore, Singapore
2005 Fall---------Visiting
Graduate Student, Department of Mathematics, Cornell University, New York, USA
2002-2005--------Bachelor
of Science (First Class Honours) in Computer Science, the University Of Auckland
, Auckland, New Zealand
2005 Nov-Feb----Summer
Scholar, Research School of Information Science and Engineering, Australian
National University, Canberra, Australia
Awards and Scholarships:
New Zealand International Doctoral
Research Scholarship 2006 - 2008
Microsoft Research Asia Felloship
2007
Papers:
Conference:
(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 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,
accepted at the Annals of Pure and Applied Logic.
In Preparation:
(with D. Kuske and M. Lohrey) The Isomorphism Problem on Classes of Automatic
Structures.
(with B. Csima and B. Khoussainov) On Computable Graphs with Finite Components.
(with B.Khoussainov, A. Gandhi) Dynamic Algorithms for Buchi Games on Tree-Like Structures
Research Interest:
I am working in the logical
foundations of computer science, in particular, the following:
- finite model theory
- automata theory and automata presentable structures
- computability theory and computable
model theory
- algorithms and data structures
Personal Details:
Name:
Jiamou Liu ( 刘佳谋 )
Office:
Room 303.576 Science building Extension
Work Phone:
+64 9 3737 599 ext 82281
Work Fax:
+64 9 3737 453 attn. Jiamou Liu
Email:
liujiamou@gmail.com /
jliu036@aucklanduni.ac.nz
Postal Address:
Department of Computer Science,
University of Auckland,
Private Bag 92019
Auckland, New Zealand
CV:download
Jiamou Liu's Homepage