| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Chung Keung Poon Chung Keung Poon: Optimal Range Max Datacube for Fixed Dimensions. ICDT 2003 : 158-172 Chung Keung Poon, Matthew Chang : An Email Classifier Based on Resemblance. ISMIS 2003 : 344-348 Chung Keung Poon: Verifying minimum stable circuit values. Inf. Process. Lett. 86 (1): 27-32 (2003) Xiaotie Deng , Chung Keung Poon, Yuzhong Zhang : Approximation Algorithms in Batch Processing. J. Comb. Optim. 7 (3): 247-257 (2003) Chung Keung Poon: Dynamic orthogonal range queries in OLAP. Theor. Comput. Sci. 3 (296): 487-510 (2003) Chung Keung Poon: Orthogonal Range Queries in OLAP. ICDT 2001 : 361-374 Chung Keung Poon, Pixing Zhang : Minimizing Makespan in Batch Machine Scheduling. ISAAC 2000 : 386-397 Chung Keung Poon: A space lower bound for st-connectivity on node-named JAGs. Theor. Comput. Sci. 237 (1-2): 327-345 (2000) Binhai Zhu , Chung Keung Poon: Efficient Approximation Algorithms for Multi-label Map Labeling. ISAAC 1999 : 143-152 Xiaotie Deng , Chung Keung Poon, Yuzhong Zhang : Approximation Algorithms in Batch Processing. ISAAC 1999 : 153-162 Jeff Edmonds , Chung Keung Poon, Dimitris Achlioptas : Tight Lower Bounds for st-Connectivity on the NNJAG Model. SIAM J. Comput. 28 (6): 2257-2284 (1999) 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) Chung Keung Poon, Vijaya Ramachandran : A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest. ISAAC 1997 : 212-222 Chung Keung Poon, Binhai Zhu , Franis Chin : A Polynomial Time Solution for Labeling a Rectilinear Map. Symposium on Computational Geometry 1997 : 451-453 Valerie King , Chung Keung Poon, Vijaya Ramachandran , Santanu Sinha : An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. Inf. Process. Lett. 62 (3): 153-159 (1997) Jeff Edmonds , Chung Keung Poon: A nearly optimal time-space lower bound for directed st -connectivity on the NNJAG model. STOC 1995 : 147-156 Bethany M. Y. 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) 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) 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 1 [ 9 ] 2 [ 3 ] 3 [ 1 ] 4 [ 18 ] 5 [ 1 ] [ 2 ] [ 3 ] [ 8 ] 6 [ 6 ] 7 [ 10 ] [ 16 ] 8 [ 4 ] [ 9 ] 9 [ 5 ] 10 [ 5 ] [ 7 ] 11 [ 5 ] 12 [ 13 ] 13 [ 10 ] [ 16 ] 14 [ 6 ] [ 8 ] [ 11 ]  ©2004 Association for Computing Machinery |
