|
|
Hao Yuan Ph.D. Student E-mail: yuan3(at)cs.purdue.edu Office: LWSN B116E (at the third desk on the right side) |
I got Bachelor's Degree from Shanghai Jiao Tong University, and I'm now a third-year Ph.D. student at Purdue University.
My advisor is Prof. Mikhail J. Atallah, and my research area is Algorithm Design and Analysis.
Unpublished Manuscripts
Hao Yuan and Mikhail J. Atallah, "Efficient Key Management for Access Control of Temporal and Geo-Spatial Data", [ draft PDF ]
Hao Yuan and Mikhail J. Atallah, "Data Structures for Range Minimum Queries in Multidimensional Arrays", [ early draft PDF ]
Conference Publications:
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 (ESOP 2009). [ DOI ]
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 (ICDT 2009). [ DOI, SLIDES]
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 (ICDCS 2008). [ revised PDF ]
Hao Yuan, Linji Yang and Erdong Chen, "Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem", in the Proceedings of 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), LNCS 3827 pages 412-421, Springer-Verlag 2005. DOI
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 (ISAAC 2005), LNCS 3827 pages 1153-1162, Springer-Verlag 2005. (DOI) This work won the Best Student Paper of ISAAC 2005.
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, Volume 13, Number 3 / April, 2007. [ DOI, PDF ]
Last Update: March 25 , 2009