|
English
|
正體中文
|
简体中文
|
Total items :0
|
|
Visitors :
51654161
Online Users :
897
Project Commissioned by the Ministry of Education
Project Executed by National Taiwan University Library
|
|
|
|
Taiwan Academic Institutional Repository >
Browse by Author
|
"lu hsueh i"
Showing items 6-15 of 88 (9 Page(s) Totally)
1 2 3 4 5 6 7 8 9 > >>
View [10|25|50] records per page
| 臺大學術典藏 |
2020-05-04T07:56:46Z |
A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree.
|
Lu, Hsueh-I; Ravi, R.; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:46Z |
Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract).
|
Klein, Philip N.;Lu, Hsueh-I;Netzer, Robert H. B.; Klein, Philip N.; Lu, Hsueh-I; Netzer, Robert H. B.; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:46Z |
Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING.
|
Klein, Philip N.;Lu, Hsueh-I; Klein, Philip N.; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:46Z |
Detecting Race Conditions in Parallel Programs that Use One Semaphore.
|
HSUEH-I LU; Netzer, Robert H. B.; Lu, Hsueh-I; Klein, Philip N. |
| 臺大學術典藏 |
2020-05-04T07:56:45Z |
Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics.
|
Goldwasser, Michael H.; Kao, Ming-Yang; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:45Z |
Floor-Planning via Orderly Spanning Trees.
|
Yen, Hsu-Chun; Lu, Hsueh-I; Liao, Chien-Chih; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:45Z |
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets.
|
Chen, Yuyu; Kao, Ming-Yang; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:45Z |
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs.
|
He, Xin; Kao, Ming-Yang; Lu, Hsueh-I; HSUEH-I LU |
| 臺大學術典藏 |
2020-05-04T07:56:45Z |
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses.
|
HSUEH-I LU; Kao, Ming-Yang; Lu, Hsueh-I; He, Xin; Garg, Ashim; Chuang, Richie Chih-Nan |
| 臺大學術典藏 |
2020-05-04T07:56:44Z |
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits.
|
Lu, Hsueh-I; HSUEH-I LU |
Showing items 6-15 of 88 (9 Page(s) Totally)
1 2 3 4 5 6 7 8 9 > >>
View [10|25|50] records per page
|
