|
|
Hao Yuan E-mail: yuan3(at)cs.purdue.edu |
I was born in Guangzhou,
a beautiful city in the south of China.
I received my Bachelor of Engineering degree in Computer Science from
Shanghai Jiao Tong University (Shanghai,
China) in 2006.
I'm now a Ph.D. candidate at Purdue University.
My advisor is Prof. Mikhail J.
Atallah, and my primary research areas are Algorithms, Databases and Information
Security.
I have very broad interests in Computer Science.
Previously, I worked with Prof.
Luo Si on Distributed
Information Retrieval.
I also worked on some algorithmic problems in Programming Languages with Prof.
Patrick Eugster.
When I was an undergrad, I collaborated with my classmates
Erdong Chen and
Linji Yang to work on
some algorithmic problems in Bioinformatics.
My CV: [ PDF ]
My Erdös Number is 3, through Mikhail J. Atallah and Samuel S. Wagstaff.
Teaching Experience
I'm the teaching assistant of the following courses at Purdue University:
(Fall 2009) CS 381 Introduction to Analysis of
Algorithms
(Spring 2009) CS 514 Numerical Analysis
(Spring 2009) CS 590I Information Retrieval
(Fall 2008) CS 381 Introduction to Analysis of
Algorithms
(Spring 2008) CS 483 Introduction to the Theory of Computation
(Fall 2006) CS 590I Information Retrieval
I was the instructor of the following undergraduate courses at Shanghai Jiao Tong University:
2005 Sep - 2006 Jan "Introduction to Programming"
(for Freshmen)
2005 Feb - 2005 July "Algorithm Design & Analyze II" (for
Sophomores)
During my college years, I gave several lectures on Olympiad Informatics
(algorithms and data structures)
to gifted high school students at Shanghai Youth Centre of Science & Technology
Education.
Refereed Conference Publications
| SODA 2010 | Hao Yuan and Mikhail J. Atallah Data Structures for Range Minimum Queries in Multidimensional Arrays in Proceedings of The 21th Annual ACM-SIAM Symposium on Discrete Algorithms [ PDF, SLIDES ] |
| GIS 2009 | 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 (poster/short paper) [ draft PDF ] |
| CIKM 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 (short paper) |
| ESOP 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] |
| ICDT 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] |
| ICDCS 2008 | 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 ] |
| ISAAC 2005 | 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 ] Nominated for Best Student Paper |
| ISAAC 2005 | 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 ] Best Student Paper |
Journal Publications
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, Special Issue on Bioinformatics, Volume 13,
Number 3 / April, 2007. [ DOI,
PDF ]
Last Update: October 7 , 2009