AUT - Jiamou Liu

AUT
Centre Banner
Main Content

Dr Jiamou Liu

Staff Profile Pic of Dr. J. Liu

Lecturer

Phone: 0064-9-9219999 ext 5868

Email: jiamou.liu@aut.ac.nz

Physical Address:

Office: WT 116, 2-14 Wakefield St

 



Postal Address:
School of Computing and Mathematical Sciences
Private Bag 92006
Auckland 1142
New Zealand


Links to relevant web pages:
http://staff.elena.aut.ac.nz/Jiamon-Liu/

Qualifications:

PhD in Computer Science, University of Auckland, 2010

BSc(Hon) First class in Computer Science, University of Auckland, 2005

Memberships and Affiliations:

Member of the New Zealand Mathematics Soceity

Member of the Association of Computability in Europe

Teaching Areas:

Data structures and algorithms

Algorithm design and analysis

Theory of computation

Research areas:

I am interested in theoretical computer science. In particular, I do research on the interactions among logic, structures and computation. The research fields that I am interested in include logic, automata theory, computability theory, algorithmic model theory and computational complexity.

Research Summary:

In the past years I studied and worked in the following research institutions outside of New Zealand:

Universitaet Leipzig,  Leipzig, Germany (2010)

Cornell University, New York, USA (2005,2007-2008)

Microsoft Research Asia (theory group), Beijing, China (2008)

National University of Singapore, Singapore (2006)

Publications:

Selected Conference Publications:
    
I. Imran, B. Khoussainov, J. Liu, Extracting Winning Strategies in Update Games, to appear in Proc. of CiE 2011.

D. Kuske, J. Liu, M. Lohrey, The isomorphism problem for \omega-automatic trees, in Proc. of CSL 2010: 396-410. LNCS 6247, Springer, 2010.
       
D. Kuske, J. Liu, M. Lohrey, The isomorphism problem for classes of automatic structures, in Proc. of LICS 2010: 160-169. IEEE Computer Society, 2010.
       
J. Liu, M. Minnes, Analysing complexity in classes of unary automatic structures, in Proc. of LATA 2009: 518-529. LNCS 5457, Springer, 2009.
   
B. Khoussainov, J. Liu, I. Khaliq, A dynamic algorithm for reachability games played on trees, in Proc. of MFCS 2009: 477-488. LNCS 5734, Springer, 2009.
       
B. Csima, B. Khoussainov, J. Liu, Computable categoricity of graphs with finite components, in Proc. of CiE 2008:139-148. LNCS 5028, Springer, 2008.
       
B. Khoussainov, J. Liu, M. Minnes, Unary automatic graphs: an algorithmic perspective, in Proc. of TAMC 2008:542-553. LNCS 4978, Springer, 2008.
       
B. Khoussainov, J. Liu, On complexity of Ehrenfeucht-Fraisse games, in Proc. of LFCS 2007:293-309. LNCS 4517, Springer, 2007.
   
Journal Publications:
   
J. Liu, M. Minnes, Deciding the isomorphism problem in classes of unary automatic strucutures. Theoretical Computer Science, Elsevier, 2011
   
B. Khoussainov, J. Liu, On complexity of Ehrenfeucht-Fraisse games. Annals of Pure and Applied Logic 161(3):404-415. 2009
   
B. Khoussainov, J. Liu, M. Minnes, Unary automatic graphs: an algorithmic perspective. Mathematical Structures in Computer Science 19(1):133-152.
   
Other works:

J. Liu, A Journey from Finite to Automatic Structures and Beyond. PhD Thesis, University of Auckland, 2010.

Awards:

Microsoft Asia Fellowship 2008

New Zealand International Doctoral Research Scholarship 2006-2009


Last updated: 15 Mar 2011 9:00am

AUT University, New Zealand | Copyright © | Privacy | Site map | IT support | Website feedback