 | 2009 |
|---|
| 55 |       | Feifeng Zheng,
Yinfeng Xu,
Chung Keung Poon:
On Job Scheduling with Preemption Penalties.
AAIM 2009: 315-325 |
| 54 | | Jing Cai,
Chung Keung Poon:
OrdPathX: Supporting Two Dimensions of Node Insertion in XML Data.
DEXA 2009: 332-339 |
| 53 | | Matthew Chang,
Chung Keung Poon:
Using phrases as features in email classification.
Journal of Systems and Software 82(6): 1036-1045 (2009) |
| 52 | | He Sun,
Chung Keung Poon:
Two improved range-efficient algorithms for F0 estimation.
Theor. Comput. Sci. 410(11): 1073-1080 (2009) |
| 51 | | Andy Kwok,
Chung Keung Poon:
Two-Dimensional Packet Classification and Filter Conflict Resolution in the Internet.
Theory Comput. Syst. 44(3): 289-303 (2009) |
| 2008 |
|---|
| 50 | | Stanley P. Y. Fung,
Chung Keung Poon,
Feifeng Zheng:
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs.
WAOA 2008: 53-66 |
| 49 | | Matthew Chang,
Chung Keung Poon:
Efficient phrase querying with common phrase index.
Inf. Process. Manage. 44(2): 756-769 (2008) |
| 48 | | Stanley P. Y. Fung,
Chung Keung Poon,
Feifeng Zheng:
Online interval scheduling: randomized and multiprocessor cases.
J. Comb. Optim. 16(3): 248-262 (2008) |
| 47 | | Ying Kit Lai,
Chung Keung Poon,
Benyun Shi:
Approximate colored range and point enclosure queries.
J. Discrete Algorithms 6(3): 420-432 (2008) |
| 46 | | 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 |
|---|
| 45 | | Stanley P. Y. Fung,
Chung Keung Poon,
Feifeng Zheng:
Online Interval Scheduling: Randomized and Multiprocessor Cases.
COCOON 2007: 176-186 |
| 44 | | Marian Choy,
Sam Lam,
Chung Keung Poon,
Fu Lee Wang,
Yuen-Tak Yu,
Leo Yuen:
Design and Implementation of an Automated System for Assessment of Computer Programming Assignments.
ICWL 2007: 584-596 |
| 43 | | He Sun,
Chung Keung Poon:
Two Improved Range-Efficient Algorithms for F 0 Estimation.
TAMC 2007: 659-669 |
| 42 | | Chung Keung Poon,
Feifeng Zheng,
Yinfeng Xu:
On-Demand Bounded Broadcast Scheduling with Tight Deadlines.
Int. J. Found. Comput. Sci. 18(2): 251-262 (2007) |
| 2006 |
|---|
| 41 |  | Siu-Wing Cheng,
Chung Keung Poon:
Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings
Springer 2006 |
| 40 | | Chung Keung Poon,
Feifeng Zheng,
Yinfeng Xu:
On-demand Bounded Broadcast Scheduling with Tight Deadlines.
CATS 2006: 139-143 |
| 39 | | 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 |
| 38 | | Chung Keung Poon,
Leo Yuen:
Faster Twig Pattern Matching Using Extended Dewey ID.
DEXA 2006: 297-306 |
| 37 | | Matthew Chang,
Chung Keung Poon:
Efficient Phrase Querying with Common Phrase Index.
ECIR 2006: 61-71 |
| 36 | | 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) |
| 35 | | Chung Keung Poon,
Wai Keung Yiu:
Opportunistic data structures for range queries.
J. Comb. Optim. 11(2): 145-154 (2006) |
| 2005 |
|---|
| 34 | | Chung Keung Poon,
Wai Keung Yiu:
Opportunistic Data Structures for Range Queries.
COCOON 2005: 560-569 |
| 33 | | Stanley P. Y. Fung,
Francis Y. L. Chin,
Chung Keung Poon:
Laxity Helps in Broadcast Scheduling.
ICTCS 2005: 251-264 |
| 32 | | Ying Kit Lai,
Chung Keung Poon,
Benyun Shi:
Approximate Colored Range Queries.
ISAAC 2005: 360-369 |
| 31 | | Pinyan Lu,
Jialin Zhang,
Chung Keung Poon,
Jin-yi Cai:
Simulating Undirected st-Connectivity Algorithms on Uniform JAGs and NNJAGs.
ISAAC 2005: 767-776 |
| 30 | | Matthew Chang,
Chung Keung Poon:
Catching the Picospams.
ISMIS 2005: 641-649 |
| 29 | | Leo Yuen,
Chung Keung Poon:
Relational Index Support for XPath Axes.
XSym 2005: 84-98 |
| 28 | | Chung Keung Poon,
Wenci Yu:
A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite Capacity.
Annals OR 133(1-4): 175-181 (2005) |
| 27 | | 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) |
| 26 | | Chung Keung Poon,
Wenci Yu:
On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity.
J. Comb. Optim. 9(2): 167-186 (2005) |
| 2004 |
|---|
| 25 | | Leo Yuen,
Matthew Chang,
Ying Kit Lai,
Chung Keung Poon:
Excalibur: A Personalized Meta Search Engine.
COMPSAC Workshops 2004: 49-50 |
| 24 | | Chung Keung Poon,
Andy Kwok:
Space Optimal Packet Classification for 2-d Conflict-free Filters.
ISPAN 2004: 260-265 |
| 23 | | Chung Keung Poon,
Pixing Zhang:
Minimizing Makespan in Batch Machine Scheduling.
Algorithmica 39(2): 155-174 (2004) |
| 22 | | Chung Keung Poon,
Wenci Yu:
On Minimizing Total Completion Time In Batch Machine Scheduling.
Int. J. Found. Comput. Sci. 15(4): 593-607 (2004) |
| 21 | | Chung Keung Poon:
Optimal Range Max Datacube For Fixed Dimensions.
Int. J. Found. Comput. Sci. 15(5): 773-790 (2004) |
| 2003 |
|---|
| 20 | | Chung Keung Poon:
Optimal Range Max Datacube for Fixed Dimensions.
ICDT 2003: 158-172 |
| 19 | | Chung Keung Poon,
Matthew Chang:
An Email Classifier Based on Resemblance.
ISMIS 2003: 344-348 |
| 18 | | Chung Keung Poon:
Verifying minimum stable circuit values.
Inf. Process. Lett. 86(1): 27-32 (2003) |
| 17 | | Xiaotie Deng,
Chung Keung Poon,
Yuzhong Zhang:
Approximation Algorithms in Batch Processing.
J. Comb. Optim. 7(3): 247-257 (2003) |
| 16 | | Chung Keung Poon:
Dynamic orthogonal range queries in OLAP.
Theor. Comput. Sci. 296(3): 487-510 (2003) |
| 2001 |
|---|
| 15 | | Chung Keung Poon:
Orthogonal Range Queries in OLAP.
ICDT 2001: 361-374 |
| 14 | | Binhai Zhu,
Chung Keung Poon:
Efficient Approximation Algorithms for Two-Label Point Labeling.
Int. J. Comput. Geometry Appl. 11(4): 455-464 (2001) |
| 2000 |
|---|
| 13 | | Chung Keung Poon,
Pixing Zhang:
Minimizing Makespan in Batch Machine Scheduling.
ISAAC 2000: 386-397 |
| 12 | | Chung Keung Poon:
A space lower bound for st-connectivity on node-named JAGs.
Theor. Comput. Sci. 237(1-2): 327-345 (2000) |
| 1999 |
|---|
| 11 | | Binhai Zhu,
Chung Keung Poon:
Efficient Approximation Algorithms for Multi-label Map Labeling.
ISAAC 1999: 143-152 |
| 10 | | Xiaotie Deng,
Chung Keung Poon,
Yuzhong Zhang:
Approximation Algorithms in Batch Processing.
ISAAC 1999: 153-162 |
| 9 | | 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) |
| 1998 |
|---|
| 8 | | 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) |
| 1997 |
|---|
| 7 | | Chung Keung Poon,
Vijaya Ramachandran:
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.
ISAAC 1997: 212-222 |
| 6 | | Chung Keung Poon,
Binhai Zhu,
Franis Chin:
A Polynomial Time Solution for Labeling a Rectilinear Map.
Symposium on Computational Geometry 1997: 451-453 |
| 5 | | 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) |
| 1995 |
|---|
| 4 | | Jeff Edmonds,
Chung Keung Poon:
A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model.
STOC 1995: 147-156 |
| 3 | | 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 |
|---|
| 2 | | 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) |
| 1991 |
|---|
| 1 | | 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 |
