| 2009 |
|---|
| 9 | EE | Hao Yuan,
Patrick Th. Eugster:
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees.
ESOP 2009: 175-189 |
| 8 | EE | Hao Yuan,
Mikhail J. Atallah:
Efficient data structures for range-aggregate queries on trees.
ICDT 2009: 111-120 |
| 2008 |
|---|
| 7 | EE | Hao Yuan,
Mikhail J. Atallah:
Efficient Distributed Third-Party Data Authentication for Tree Hierarchies.
ICDCS 2008: 184-193 |
| 6 | EE | Luo Si,
Jamie Callan,
Suleyman Cetintas,
Hao Yuan:
An effective and efficient results merging strategy for multilingual information retrieval in federated search environments.
Inf. Retr. 11(1): 1-24 (2008) |
| 2007 |
|---|
| 5 | EE | Du Wan Cheun,
Jeong Seop Bae,
Won Young Jeon,
Hao Yuan,
Soo Dong Kim:
A Practical Framework of Dynamic Monitors in Service-Oriented Computing.
ICEBE 2007: 626-630 |
| 4 | EE | Erdong Chen,
Linji Yang,
Hao Yuan:
Improved algorithms for largest cardinality 2-interval pattern problem.
J. Comb. Optim. 13(3): 263-275 (2007) |
| 3 | EE | Erdong Chen,
Linji Yang,
Hao Yuan:
Longest increasing subsequences in windows based on canonical antichain partition.
Theor. Comput. Sci. 378(3): 223-236 (2007) |
| 2005 |
|---|
| 2 | EE | Erdong Chen,
Hao Yuan,
Linji Yang:
Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition.
ISAAC 2005: 1153-1162 |
| 1 | EE | Hao Yuan,
Linji Yang,
Erdong Chen:
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem.
ISAAC 2005: 412-421 |
