Hao YUAN  E-mail: haoyuan(at)cityu.edu.hk  Office: Y6422, Academic Building  Phone: (852) 3442 2591

I received my bachelor's degree from Shanghai Jiao Tong University, and Ph.D. degree from Purdue University.
I am now an assistant professor in the Department of Computer Science, City University of Hong Kong. 

Research Interests 

Algorithms, Databases, and Information Security.

Job Vacancy

I am recruiting Ph.D. students. You are welcome to contact me regarding your Ph.D. application.
Please mention my name in your Ph.D. application if you are interested in working with me.

A full-time research assistant position (not a studentship) is also available.
A bachelor's degree is required for this position.

Teaching

CS 3391 Advanced Programming (ACM Programming Contest Training)
CS 4335 Design and Analysis of Algorithms (2010-2011 Semester A)
CS 4288 Cryptographic Algorithms and Protocols (2010-2011 Semester B, 2011-2012 Semester B)
CS 5288 Cryptography: Theory and Practice (2010-2011 Semester B, 2011-2012 Semester B)
CS 5286 Algorithms and Techniques for Web Searching (2011-2012 Semester A) 

To students: course materials will be posted on the BLACKBOARD system.

Journal Publications

Hao Yuan and Mikhail J. Atallah,
“Running Max/Min Filters using 1+o(1) Comparisons per Sample”,
IEEE Transactions on Pattern Analysis and Machine Intelligence, Volume 33, Issue 12, Pages 2544-2548, December 2011. [ DOI, PDF ]

Mikhail J. Atallah, Yinian Qi, and Hao Yuan,
"Asymptotically Efficient Algorithms for Skyline Probabilities of Uncertain Data",
ACM Transactions on Database Systems, Volume 36 Issue 2, May 2011. [ DOI ]

Luo Si, Jamie Callan, Suleyman Cetintas and Hao Yuan,
"An effective and efficient results merging strategy for multilingual information retrieval in federated search environments",
Information Retrieval, Volume 11, Number 1 / February, 2008. [ DOI ]

Erdong Chen, Linji Yang and Hao Yuan,
"Longest Increasing Subsequences in Windows based on Canonical Antichain Partition",
Theoretical Computer Science, Volume 378, Issue 3, 9 June 2007, Pages 223-236. [ DOI, PDF ]

Erdong Chen, Linji Yang and Hao Yuan,
"Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem",
Journal of Combinatorial Optimization, Volume 13, Number 3 / April, 2007. [ DOI, PDF ]

Refereed Conference Publications

Jing He, Hongyu Liang and Hao Yuan
Controlling Infection by Blocking Nodes and Links Simultaneously
to appear in The 7th Workshop on Internet & Network Economics [ DOI ]
WINE 2011

Keith B. Frikken, Hao Yuan and Mikhail J. Atallah
Secure Authenticated Comparisons
in Proceedings of The 9th International Conference on Applied Cryptography and Network Security [ DOI ]
ACNS 2011

Hao Yuan and Mikhail J. Atallah
Data Structures for Range Minimum Queries in Multidimensional Arrays
in Proceedings of The 21st Annual ACM-SIAM Symposium on Discrete Algorithms  [ PDF, SLIDES ]
SODA 2010

Hao Yuan and Mikhail J. Atallah
Efficient and Secure Distribution of Massive Geo-Spatial Data
in Proceedings of The 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems [ draft PDF ]
GIS 2009

Suleyman Cetintas, Luo Si and Hao Yuan
Learning from Past Queries for Resource Selection
in Proceedings of The 18th ACM Conference on Information and Knowledge Management [ DOI ]
CIKM 2009

Hao Yuan and Patrick Eugster
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
in Proceedings of The 18th European Symposium on Programming [ DOI, PDF]
ESOP 2009

Hao Yuan and Mikhail J. Atallah
Efficient Data Structures for Range-Aggregate Queries on Trees
in Proceedings of The 12th International Conference on Database Theory [ PDF, SLIDES]
ICDT 2009

Hao Yuan and Mikhail J. Atallah
Efficient Distributed Third-Party Data Authentication for Tree Hierarchies
in Proceedings of The 28th International Conference on Distributed Computing Systems [ revised PDF ]
ICDCS 2008

Hao Yuan, Linji Yang and Erdong Chen
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem
in Proceedings of 16th Annual International Symposium on Algorithms and Computation [ DOI ]
ISAAC 2005, Nominated for Best Student Paper

Erdong Chen, Hao Yuan and Linji Yang
Longest Increasing Subsequences in Windows based on Canonical Antichain Partition
in Proceedings of 16th Annual International Symposium on Algorithms and Computation [ revised PDF ]
ISAAC 2005, Best Student Paper

---

Last Update: July 27, 2011