|
|
Hao Yuan Graduate Student at E-mail: yuan3(at)cs.purdue.edu Office: LWSN B132 |
I did my undergraduate study at
My advisor is Prof. Mikhail Atallah, and my research area is Algorithm Design and Analysis, with a focus on Security and Privacy.
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 LINK ]
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. [ DOILINK, DRAFT ]
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 LINK, DRAFT ]
Conference Publications:
Hao Yuan and Mikhail J. Atallah, "Efficient Distributed Third-Party Data Authentication for Tree Hierarchies", to appear in The 28th International Conference on Distributed Computing Systems (ICDCS 2008).
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 LINK) This work won the Best Student Paper of ISAAC 2005. NOTES: Please refer to our journal version for more detailed description of our sweep-line algorithm.
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 LINK
Last Update: February 11, 2008