| 2009 |
|---|
| 140 | EE | Mee Yee Chan,
Wun-Tat Chan,
Francis Y. L. Chin,
Stanley P. Y. Fung,
Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops.
SIAM J. Comput. 38(6): 2179-2197 (2009) |
| 2008 |
|---|
| 139 | EE | Francis Y. L. Chin,
Henry C. M. Leung,
Man-Hung Siu,
Siu-Ming Yiu:
Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency.
APBC 2008: 343-352 |
| 138 | EE | Joseph Wun-Tat Chan,
Francis Y. L. Chin,
Xiangyu Hong,
Hing-Fung Ting:
Dynamic Offline Conflict-Free Coloring for Unit Disks.
WAOA 2008: 241-252 |
| 137 | EE | Francis Y. L. Chin,
Siu-Ming Yiu:
Efficient Methods for Multiple Sequence Alignment with Guaranteed Error Bounds.
Encyclopedia of Algorithms 2008 |
| 136 | EE | Francis Y. L. Chin,
Henry C. M. Leung:
DNA Motif Representation with Nucleotide Dependency.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(1): 110-119 (2008) |
| 135 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Guochuan Zhang,
Yong Zhang:
On-line scheduling of parallel jobs on two machines.
J. Discrete Algorithms 6(1): 3-10 (2008) |
| 134 | EE | Stanley P. Y. Fung,
Feifeng Zheng,
Wun-Tat Chan,
Francis Y. L. Chin,
Chung Keung Poon,
Prudence W. H. Wong:
Improved on-line broadcast scheduling with deadlines.
J. Scheduling 11(4): 299-308 (2008) |
| 2007 |
|---|
| 133 | EE | Francis Y. L. Chin,
Yong Zhang,
Hong Zhu:
Online OVSF Code Assignment with Resource Augmentation.
AAIM 2007: 191-200 |
| 132 | EE | Francis Y. L. Chin:
Online Frequency Assignment in Wireless Communication Networks.
COCOON 2007: 2 |
| 131 | EE | Francis Y. L. Chin,
Yong Zhang,
Hong Zhu:
A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs.
COCOON 2007: 526-536 |
| 130 | EE | Jacky S-C. Yuk,
Kwan-Yee Kenneth Wong,
Ronald H. Y. Chung,
K. P. Chow,
Francis Y. L. Chin,
Kenneth S. H. Tsang:
Object-Based Surveillance Video Retrieval System with Real-Time Indexing Methodology.
ICIAR 2007: 626-637 |
| 129 | EE | Francis Y. L. Chin,
Hing-Fung Ting,
Yong Zhang:
A Constant-Competitive Algorithm for Online OVSF Code Assignment.
ISAAC 2007: 452-463 |
| 128 | EE | Henry C. M. Leung,
Francis Y. L. Chin,
Bethany Man-Yee Chan:
Discovering Motifs With Transcription Factor Domain Knowledge.
Pacific Symposium on Biocomputing 2007: 472-483 |
| 127 | | X. He,
N. H. C. Yung,
K. P. Chow,
Francis Y. L. Chin,
Ronald H. Y. Chung,
Kwan-Yee Kenneth Wong,
Kenneth S. H. Tsang:
Watershed segmentation with boundary curvature ratio based merging criterion.
SIP 2007: 7-12 |
| 126 | EE | Joseph Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Yong Zhang:
Online frequency allocation in cellular networks.
SPAA 2007: 241-249 |
| 125 | EE | Francis Y. L. Chin,
Henry C. M. Leung,
Wing-Kin Sung,
Siu-Ming Yiu:
The Point Placement Problem on a Line - Improved Bounds for Pairwise Distance Queries.
WABI 2007: 372-382 |
| 124 | EE | Keqiu Li,
Hong Shen,
Francis Y. L. Chin,
Weishi Zhang:
Multimedia Object Placement for Transparent Data Replication.
IEEE Trans. Parallel Distrib. Syst. 18(2): 212-224 (2007) |
| 123 | EE | Joseph Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Yong Zhang,
Hong Zhu:
Greedy online frequency allocation in cellular networks.
Inf. Process. Lett. 102(2-3): 55-61 (2007) |
| 122 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Guochuan Zhang,
Yong Zhang:
Online bin packing of fragile objects with application in cellular networks.
J. Comb. Optim. 14(4): 427-435 (2007) |
| 2006 |
|---|
| 121 | EE | Francis Y. L. Chin,
Henry C. M. Leung:
An Efficient Algorithm for String Motif Discovery.
APBC 2006: 79-88 |
| 120 | | Henry C. M. Leung,
Francis Y. L. Chin:
Discovering DNA Motifs with Nucleotide Dependency.
BIBE 2006: 70-80 |
| 119 | EE | Feifeng Zheng,
Stanley P. Y. Fung,
Wun-Tat Chan,
Francis Y. L. Chin,
Chung Keung Poon,
Prudence W. H. Wong:
Improved On-Line Broadcast Scheduling with Deadlines.
COCOON 2006: 320-329 |
| 118 | EE | Joseph Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Yong Zhang,
Hong Zhu:
Frequency Allocation Problems for Linear Cellular Networks.
ISAAC 2006: 61-70 |
| 117 | EE | Bethany Man-Yee Chan,
Joseph Wun-Tat Chan,
Francis Y. L. Chin,
Stanley P. Y. Fung,
Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees Without Recombinations.
WABI 2006: 56-67 |
| 116 | EE | Henry C. M. Leung,
Francis Y. L. Chin:
Finding motifs from all sequences with and without binding sites.
Bioinformatics 22(18): 2217-2223 (2006) |
| 115 | EE | Henry C. M. Leung,
Francis Y. L. Chin:
An efficient motif discovery algorithm with unknown motif length and number of binding sites.
IJDMB 1(2): 201-215 (2006) |
| 114 | EE | Feifeng Zheng,
Francis Y. L. Chin,
Stanley P. Y. Fung,
Chung Keung Poon,
Yinfeng Xu:
A tight lower bound for job scheduling with cancellation.
Inf. Process. Lett. 97(1): 1-3 (2006) |
| 113 | EE | Henry C. M. Leung,
Francis Y. L. Chin:
Algorithms for Challenging Motif Problems.
J. Bioinformatics and Computational Biology 4(1): 43-58 (2006) |
| 112 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Yong Zhang,
Hong Zhu,
Hong Shen,
Prudence W. H. Wong:
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time.
J. Comb. Optim. 11(2): 177-187 (2006) |
| 111 | EE | Mee Yee Chan,
Danny Z. Chen,
Francis Y. L. Chin,
Cao An Wang:
Construction of the nearest neighbor embracing graph of a point set.
J. Comb. Optim. 11(4): 435-443 (2006) |
| 110 | EE | Francis Y. L. Chin,
Marek Chrobak,
Stanley P. Y. Fung,
Wojciech Jawor,
Jiri Sgall,
Tomás Tichý:
Online competitive algorithms for maximizing weighted throughput of unit jobs.
J. Discrete Algorithms 4(2): 255-276 (2006) |
| 2005 |
|---|
| 109 | EE | Francis Y. L. Chin,
Henry C. M. Leung:
Voting algorithms for discovering long motifs.
APBC 2005: 261-271 |
| 108 | EE | Henry C. M. Leung,
Francis Y. L. Chin:
An Efficient Algorithm for the Extended (l, d)-Motif Problem with Unknown Number of Binding Sites.
BIBE 2005: 11-18 |
| 107 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Yong Zhang,
Hong Zhu,
Hong Shen,
Prudence W. H. Wong:
Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling.
COCOON 2005: 318-328 |
| 106 | EE | Henry C. M. Leung,
Francis Y. L. Chin:
Finding exact optimal motifs in matrix representation by partitioning.
ECCB/JBI 2005: 92 |
| 105 | EE | Keqiu Li,
Hong Shen,
Francis Y. L. Chin:
Cooperative Determination on Cache Replacement Candidates for Transcoding Proxy Caching.
ICCNMC 2005: 178-187 |
| 104 | EE | Boris Wai-Sing Yiu,
Kwan-Yee Kenneth Wong,
Francis Y. L. Chin,
Ronald H. Y. Chung:
Explicit contour model for vehicle tracking with automatic hypothesis validation.
ICIP (2) 2005: 582-589 |
| 103 | EE | Stanley P. Y. Fung,
Francis Y. L. Chin,
Chung Keung Poon:
Laxity Helps in Broadcast Scheduling.
ICTCS 2005: 251-264 |
| 102 | EE | Keqiu Li,
Hong Shen,
Francis Y. L. Chin:
Placement Solutions for Multiple Versions of A Multimedia Object.
ISORC 2005: 224-231 |
| 101 | EE | Francis Y. L. Chin,
Qiangfeng Zhang,
Hong Shen:
k-Recombination Haplotype Inference in Pedigrees.
International Conference on Computational Science (2) 2005: 985-993 |
| 100 | EE | Ronald H. Y. Chung,
Francis Y. L. Chin,
Kwan-Yee Kenneth Wong,
K. P. Chow,
T. Luo,
Henry S. K. Fung:
Efficient Block-based Motion Segmentation Method using Motion Vector Consistency.
MVA 2005: 550-553 |
| 99 | | Angie W. K. So,
Kwan-Yee Kenneth Wong,
Ronald H. Y. Chung,
Francis Y. L. Chin:
Shadow detection for vehicles by locating the object-shadow boundary.
SIP 2005: 315-319 |
| 98 | EE | Henry C. M. Leung,
Francis Y. L. Chin:
Generalized Planted (l, d)-Motif Problem with Negative Set.
WABI 2005: 264-275 |
| 97 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Deshi Ye,
Guochuan Zhang,
Yong Zhang:
Online Bin Packing of Fragile Objects with Application in Cellular Networks.
WINE 2005: 564-573 |
| 96 | EE | Keqiu Li,
Hong Shen,
Francis Y. L. Chin,
Si-Qing Zheng:
Optimal methods for coordinated enroute web caching for tree networks.
ACM Trans. Internet Techn. 5(3): 480-507 (2005) |
| 95 | EE | Stanley P. Y. Fung,
Francis Y. L. Chin,
Chung Keung Poon:
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees.
Comput. Geom. 32(1): 1-12 (2005) |
| 94 | EE | Stanley P. Y. Fung,
Francis Y. L. Chin,
Hong Shen:
Online scheduling of unit jobs with bounded importance ratio.
Int. J. Found. Comput. Sci. 16(3): 581-598 (2005) |
| 93 | EE | Francis Y. L. Chin,
N. L. Ho,
Tak Wah Lam,
Prudence W. H. Wong:
Efficient Constrained Multiple Sequence Alignment with Performance Guarantee.
J. Bioinformatics and Computational Biology 3(1): 1-18 (2005) |
| 92 | EE | Henry C. M. Leung,
Francis Y. L. Chin,
Siu-Ming Yiu,
Ronald Rosenfeld,
Wai Wan Tsang:
Finding Motifs with Insufficient Number of Strong Binding Sites.
Journal of Computational Biology 12(6): 686-701 (2005) |
| 91 | EE | Qiangfeng Zhang,
Francis Y. L. Chin,
Hong Shen:
Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees.
T. Comp. Sys. Biology 2: 100-112 (2005) |
| 2004 |
|---|
| 90 | EE | Francis Y. L. Chin,
Jianbo Qian,
Cao An Wang:
Progress on Maximum Weight Triangulation.
COCOON 2004: 53-61 |
| 89 | EE | Francis Y. L. Chin,
Henry C. M. Leung,
Siu-Ming Yiu,
Tak Wah Lam,
Roni Rosenfeld,
Wai Wan Tsang,
David K. Smith,
Y. Jiang:
Finding motifs for insufficient number of sequences with strong binding to transcription facto.
RECOMB 2004: 125-132 |
| 88 | EE | Yair Bartal,
Francis Y. L. Chin,
Marek Chrobak,
Stanley P. Y. Fung,
Wojciech Jawor,
Ron Lavi,
Jiri Sgall,
Tomás Tichý:
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.
STACS 2004: 187-198 |
| 87 | EE | Mee Yee Chan,
Danny Z. Chen,
Francis Y. L. Chin,
Cao An Wang:
Construction of the Nearest Neighbor Embracing Graph of a Point Set.
SWAT 2004: 150-160 |
| 86 | EE | Francis Y. L. Chin,
Alfredo De Santis,
Anna Lisa Ferrara,
N. L. Ho,
S. K. Kim:
A simple algorithm for the constrained sequence problems.
Inf. Process. Lett. 90(4): 175-179 (2004) |
| 85 | EE | Francis Y. L. Chin,
Xiaotie Deng,
Qizhi Fang,
Shanfeng Zhu:
Approximate and dynamic rank aggregation.
Theor. Comput. Sci. 325(3): 409-424 (2004) |
| 84 | EE | Francis Y. L. Chin,
Stanley P. Y. Fung:
Improved competitive algorithms for online scheduling with partial job values.
Theor. Comput. Sci. 325(3): 467-478 (2004) |
| 2003 |
|---|
| 83 | EE | Francis Y. L. Chin,
Stanley P. Y. Fung:
Improved Competitive Algorithms for Online Scheduling with Partial Job Values.
COCOON 2003: 425-434 |
| 82 | EE | Francis Y. L. Chin,
N. L. Ho,
Tak Wah Lam,
Prudence W. H. Wong,
Mee Yee Chan:
Efficient Constrained Multiple Sequence Alignment with Performance Guarantee.
CSB 2003: 337-346 |
| 81 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Hing-Fung Ting:
Escaping a Grid by Edge-Disjoint Paths.
Algorithmica 36(4): 343-359 (2003) |
| 80 | EE | Francis Y. L. Chin,
Stanley P. Y. Fung:
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
Algorithmica 37(3): 149-164 (2003) |
| 79 | EE | Francis Y. L. Chin,
Fu Lee Wang:
Erratum to: "Efficient algorithm for transversal of disjoint convex polygons".
Inf. Process. Lett. 85(1): 53 (2003) |
| 78 | EE | Francis Y. L. Chin,
Hong Shen,
Fu Lee Wang:
Transversal of disjoint convex polygons.
Inf. Process. Lett. 85(1): 55-60 (2003) |
| 2002 |
|---|
| 77 | EE | Francis Y. L. Chin,
C. K. M. Wong,
V. Mak:
Experiences in Running a Flexible, Web-Based, and Self-Paced Course.
ICWL 2002: 241-251 |
| 76 | EE | Boting Yang,
Cao An Wang,
Francis Y. L. Chin:
Algorithms and Complexity for Tetrahedralization Detections.
ISAAC 2002: 296-307 |
| 75 | EE | Francis Y. L. Chin,
Fu Lee Wang:
Efficient algorithm for transversal of disjoint convex polygons.
Inf. Process. Lett. 83(3): 141-144 (2002) |
| 2001 |
|---|
| 74 | | Ke Wang,
Yu He,
David Wai-Lok Cheung,
Francis Y. L. Chin:
Mining Confident Rules Without Support Requirement.
CIKM 2001: 89-96 |
| 73 | EE | Francis Y. L. Chin,
Stanley P. Y. Fung:
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees.
ISAAC 2001: 172-184 |
| 72 | EE | Francis Y. L. Chin,
Stanley P. Y. Fung,
Cao An Wang:
Approximation for minimum triangulation of convex polyhedra.
SODA 2001: 128-137 |
| 71 | EE | Francis Y. L. Chin,
Stanley P. Y. Fung,
Cao An Wang:
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes.
Discrete & Computational Geometry 26(4): 499-511 (2001) |
| 2000 |
|---|
| 70 | EE | Cao An Wang,
Francis Y. L. Chin,
Bo-Ting Yang:
Triangulations without Minimum-Weight Drawing.
CIAC 2000: 163-173 |
| 69 | | Hong Shen,
Francis Y. L. Chin:
Selection and Multiselection on Multi-Dimensional Meshes.
PDPTA 2000 |
| 68 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Hing-Fung Ting:
Escaping a grid by edge-disjoint paths.
SODA 2000: 726-734 |
| 67 | EE | Cao An Wang,
Francis Y. L. Chin,
Boting Yang:
Triangulations without minimum-weight drawing.
Inf. Process. Lett. 74(5-6): 183-189 (2000) |
| 66 | | Wun-Tat Chan,
Francis Y. L. Chin:
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids.
J. Algorithms 34(2): 337-369 (2000) |
| 1999 |
|---|
| 65 | EE | Francis Y. L. Chin,
Cao An Wang,
Fu Lee Wang:
Maximum Stabbing Line in 2D Plane.
COCOON 1999: 379-388 |
| 64 | EE | Wun-Tat Chan,
Francis Y. L. Chin,
Hing-Fung Ting:
A Faster Algorithm for Finding Disjoint Paths in Grids.
ISAAC 1999: 393-402 |
| 63 | EE | Francis Y. L. Chin,
Der-Tsai Lee,
Cao An Wang:
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane.
WADS 1999: 231-240 |
| 62 | EE | Francis Y. L. Chin,
Jack Snoeyink,
Cao An Wang:
Finding the Medial Axis of a Simple Polygon in Linear Time.
Discrete & Computational Geometry 21(3): 405-420 (1999) |
| 61 | EE | Hong Shen,
Francis Y. L. Chin,
Yi Pan:
Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks.
IEEE Trans. Parallel Distrib. Syst. 10(10): 1012-1025 (1999) |
| 60 | EE | Cao An Wang,
Francis Y. L. Chin,
Bo-Ting Yang:
Maximum Weight Triangulation and Graph Drawing.
Inf. Process. Lett. 70(1): 17-22 (1999) |
| 1998 |
|---|
| 59 | EE | Cao An Wang,
Francis Y. L. Chin,
Bo-Ting Yang:
Maximum Weight Triangulation and Its Application on Graph Drawing.
COCOON 1998: 25-34 |
| 58 | EE | Cao An Wang,
Francis Y. L. Chin,
Bo-Ting Yang:
Maximum Weight Triangulation and Graph Drawing.
Graph Drawing 1998: 460-461 |
| 57 | EE | Chung Keung Poon,
Binhai Zhu,
Francis Y. L. Chin:
A Polynomial Time Solution for Labeling a Rectlinear Map.
Inf. Process. Lett. 65(4): 201-207 (1998) |
| 56 | | Francis Y. L. Chin,
Cao An Wang:
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time.
SIAM J. Comput. 28(2): 471-486 (1998) |
| 1997 |
|---|
| 55 | | K. W. Chan,
Francis Y. L. Chin:
Optimal Multiresolution Polygonal Approximation.
COCOON 1997: 32-41 |
| 54 | | Wun-Tat Chan,
Francis Y. L. Chin:
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle.
ISAAC 1997: 314-323 |
| 53 | | Wun-Tat Chan,
Francis Y. L. Chin:
Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract).
SODA 1997: 454-463 |
| 52 | | Cao An Wang,
Francis Y. L. Chin,
Yin-Feng Xu:
A New Subgraph of Minimum Weight Triangulations.
J. Comb. Optim. 1(2): 115-127 (1997) |
| 51 | | Yue Man Sun,
Wenping Wang,
Francis Y. L. Chin:
Interpolating Polyhedral Models Using Intrinsic Shape Parameters.
Journal of Visualization and Computer Animation 8(2): 81-96 (1997) |
| 1996 |
|---|
| 50 | | Cao An Wang,
Francis Y. L. Chin,
Yin-Feng Xu:
A New Subgraph of Minimum Weight Triangulations.
ISAAC 1996: 266-274 |
| 49 | | Mee Yee Chan,
Francis Y. L. Chin,
C. N. Chu,
W. K. Mak:
Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes.
J. Parallel Distrib. Comput. 33(1): 98-106 (1996) |
| 1995 |
|---|
| 48 | | Cao An Wang,
Francis Y. L. Chin:
Finding the Constrained Delaunay Triangulation and Constrainted Voronoi Diagram of a Simple Polygon in Linear-Time (Extended Abstract).
ESA 1995: 280-294 |
| 47 | | Francis Y. L. Chin,
Jack Snoeyink,
Cao An Wang:
Finding the Medial Axis of a Simple Polygon in Linear Time.
ISAAC 1995: 382-391 |
| 46 | | Sheng Zhong,
Francis Y. L. Chin:
Improved and Optimal Adaptive Hierarchical Vector Quantization for Image Coding and Indexing.
IW-MMDBMS 1995: 102-109 |
| 45 | EE | Bethany Man-Yee Chan,
Francis Y. L. Chin,
Chung Keung Poon:
Optimal Simulation of Full Binary Trees on Faulty Hypercubes.
IEEE Trans. Parallel Distrib. Syst. 6(3): 269-286 (1995) |
| 1994 |
|---|
| 44 | | Francis Y. L. Chin,
Cao An Wang:
On Greedy Tetrahedralization of Points in 3D.
ISAAC 1994: 532-540 |
| 43 | | Francis Y. L. Chin,
Chung Keung Poon:
Performance Analysis of Some Simple Heuristics for Computing Longest Common Subsequences.
Algorithmica 12(4/5): 293-311 (1994) |
| 1993 |
|---|
| 42 | | Kam-Wing Ng,
Prabhakar Raghavan,
N. V. Balasubramanian,
Francis Y. L. Chin:
Algorithms and Computation, 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993, Proceedings
Springer 1993 |
| 41 | | Mee Yee Chan,
Francis Y. L. Chin,
C. N. Chu,
W. K. Mak:
Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes.
SPDP 1993: 285-289 |
| 40 | | Mee Yee Chan,
Francis Y. L. Chin:
Schedulers for Larger Classes of Pinwheel Instances.
Algorithmica 9(5): 425-462 (1993) |
| 39 | EE | Mee Yee Chan,
Francis Y. L. Chin:
Optimal Resilient Distributed Algorithms for Ring Election.
IEEE Trans. Parallel Distrib. Syst. 4(4): 475-480 (1993) |
| 38 | EE | Mee Yee Chan,
Francis Y. L. Chin:
A Parallel Algorithm for an Efficient Mapping of Grids in Hypercubes.
IEEE Trans. Parallel Distrib. Syst. 4(8): 933-946 (1993) |
| 1992 |
|---|
| 37 | | Mee Yee Chan,
Francis Y. L. Chin:
General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction.
IEEE Trans. Computers 41(6): 755-768 (1992) |
| 1991 |
|---|
| 36 | | Mee Yee Chan,
Francis Y. L. Chin,
Chung Keung Poon:
Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes.
ISA 1991: 241-250 |
| 1990 |
|---|
| 35 | | Joseph Y.-T. Leung,
Tommy W. Tam,
C. S. Wong,
Gilbert H. Young,
Francis Y. L. Chin:
Packing Squares into a Square.
J. Parallel Distrib. Comput. 10(3): 271-275 (1990) |
| 34 | | Francis Y. L. Chin,
H. F. Ting:
Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees.
SIAM J. Comput. 19(4): 612-626 (1990) |
| 1989 |
|---|
| 33 | | Wai Wan Tsang,
Tak Wah Lam,
Francis Y. L. Chin:
An Optimal EREW Parallel Algorithm for Parenthesis Matching.
ICPP (3) 1989: 185-192 |
| 1988 |
|---|
| 32 | | Mee Yee Chan,
Francis Y. L. Chin:
Distributed Election in Complete Networks.
Distributed Computing 3(1): 19-22 (1988) |
| 31 | | Mee Yee Chan,
Francis Y. L. Chin:
On Embedding Rectangular Grids in Hypercubes.
IEEE Trans. Computers 37(10): 1285-1288 (1988) |
| 1987 |
|---|
| 30 | | Mee Yee Chan,
Francis Y. L. Chin:
Optimal Resilient Ring Election Algorithms.
WDAG 1987: 345-354 |
| 29 | | Francis Y. L. Chin,
H. F. Ting:
An Improved Algorithm for Finding the Median Distributively.
Algorithmica 2: 235-249 (1987) |
| 28 | | Francis Y. L. Chin,
K. V. S. Ramarao:
An Information-Based Model for Failure-Handling in Distributed Database Systems.
IEEE Trans. Software Eng. 13(4): 420-431 (1987) |
| 1986 |
|---|
| 27 | EE | Francis Y. L. Chin:
Security problems on inference control for SUM, MAX, and MIN queries.
J. ACM 33(3): 451-464 (1986) |
| 26 | | Francis Y. L. Chin,
K. V. S. Ramarao:
Optimal Termination Protocols for Network Partitioning.
SIAM J. Comput. 15(1): 131-144 (1986) |
| 1985 |
|---|
| 25 | | Francis Y. L. Chin,
H. F. Ting:
An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees
FOCS 1985: 257-266 |
| 24 | | Francis Y. L. Chin,
H. F. Ting:
A Near-optimal Algorithm for Finding the Median Distributively.
ICDCS 1985: 459-465 |
| 23 | | Francis Y. L. Chin,
Jeffrey Sampson,
Cao An Wang:
A unifying approach for a class of problems in the computational geometry of polygons.
The Visual Computer 1(2): 124-132 (1985) |
| 1984 |
|---|
| 22 | | Francis Y. L. Chin,
Cao An Wang:
Minimum Vertex Distance Between Separable Convex Polygons.
Inf. Process. Lett. 18(1): 41-45 (1984) |
| 21 | | Yung H. Tsin,
Francis Y. L. Chin:
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems.
SIAM J. Comput. 13(3): 580-599 (1984) |
| 20 | | Francis Y. L. Chin,
Peter Kossowski,
S. C. Loh:
Efficient Inference Control for Range SUM Queries.
Theor. Comput. Sci. 32: 77-86 (1984) |
| 1983 |
|---|
| 19 | EE | Francis Y. L. Chin,
K. V. S. Ramarao:
Optimal Termination Prococols for Network Partitioning.
PODS 1983: 25-35 |
| 18 | | Francis Y. L. Chin,
Cao An Wang:
Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons.
IEEE Trans. Computers 32(12): 1203-1207 (1983) |
| 17 | | Yung H. Tsin,
Francis Y. L. Chin:
A General Program Scheme for Finding Bridges.
Inf. Process. Lett. 17(5): 269-272 (1983) |
| 1982 |
|---|
| 16 | | Francis Y. L. Chin,
John Lam,
I-Ngo Chen:
Efficient Parallel Algorithms for Some Graph Problems.
Commun. ACM 25(9): 659-665 (1982) |
| 15 | | Gultekin Özsoyoglu,
Francis Y. L. Chin:
Enhancing the Security of Statistical Databases with a Question-Answering System and a Kernel Design.
IEEE Trans. Software Eng. 8(3): 223-234 (1982) |
| 14 | | Francis Y. L. Chin,
Gultekin Özsoyoglu:
Auditing and Inference Control in Statistical Databases.
IEEE Trans. Software Eng. 8(6): 574-582 (1982) |
| 13 | | James O. Achugbue,
Francis Y. L. Chin:
Scheduling the Open Shop to Minimize Mean Flow Time.
SIAM J. Comput. 11(4): 709-720 (1982) |
| 1981 |
|---|
| 12 | EE | Francis Y. L. Chin,
Peter Kossowski:
Efficient Inference Control for Range SUM Queries on Statistical Data Bases.
SSDBM 1981: 239-248 |
| 11 | EE | Francis Y. L. Chin,
Gultekin Özsoyoglu:
Statistical Database Design.
ACM Trans. Database Syst. 6(1): 113-139 (1981) |
| 10 | EE | James O. Achugbue,
Francis Y. L. Chin:
Bounds on Schedules for Independent Tasks with Similar Execution Times.
J. ACM 28(1): 81-99 (1981) |
| 9 | EE | Francis Y. L. Chin,
Long-Lieh Tsai:
On J-maximal and J-minimal Flow-Shop Schedules.
J. ACM 28(3): 462-476 (1981) |
| 1980 |
|---|
| 8 | | Francis Y. L. Chin,
K. Samson Fok:
Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops).
IEEE Trans. Computers 29(7): 618-631 (1980) |
| 1978 |
|---|
| 7 | EE | Francis Y. L. Chin:
Security in Statistical Databases for Queries with Small Counts.
ACM Trans. Database Syst. 3(1): 92-104 (1978) |
| 6 | | Francis Y. L. Chin:
An O(n) Algorithm for Determining a Near-Optimal Computation Order of Matrix Chain Products.
Commun. ACM 21(7): 544-549 (1978) |
| 5 | | Francis Y. L. Chin,
David Houck:
Algorithms for Updating Minimal Spanning Trees.
J. Comput. Syst. Sci. 16(3): 333-344 (1978) |
| 1977 |
|---|
| 4 | EE | Clement T. Yu,
Francis Y. L. Chin:
A Study on the Protection of Statistical Data Bases.
SIGMOD Conference 1977: 169-181 |
| 3 | | Francis Y. L. Chin,
Kenneth Steiglitz:
A Fast Error Evaluation Algorithm for Polynomial Approximation.
Inf. Process. Lett. 6(1): 18-21 (1977) |
| 2 | | Francis Y. L. Chin:
The Partial Fraction Expansion Problem and Its Inverse.
SIAM J. Comput. 6(3): 554-562 (1977) |
| 1976 |
|---|
| 1 | | Francis Y. L. Chin:
A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation.
SIAM J. Comput. 5(4): 682-690 (1976) |
