Search the dblp DataBase
J. Y. Guo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- J. Y. Guo, Frank K. Hwang
An almost-linear time and linear space algorithm for the longest common subsequence problem. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2005, v:94, n:3, pp:131-135 [Journal] - F. H. Chang, H. B. Chen, J. Y. Guo, Frank K. Hwang, Uriel G. Rothblum
One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions. [Citation Graph (0, 0)][DBLP]
J. Comb. Optim., 2006, v:11, n:3, pp:321-339 [Journal] - F. H. Chang, J. Y. Guo, Frank K. Hwang
Wide-sense nonblocking for multi-logdN networks under various routing strategies. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:352, n:1-3, pp:232-239 [Journal] - F. H. Chang, J. Y. Guo, Frank K. Hwang, C. K. Lin
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2004, v:314, n:3, pp:375-386 [Journal] - F. H. Chang, J. Y. Guo, Frank K. Hwang, J. S. Lee
Counting disjoint 2-partitions for points in the plane. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2007, v:155, n:16, pp:2087-2092 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002