Welcome to DiSC 2002
SIGMOD 2001
PODS 2001
SIGMOD RECORD 2001
CIKM 2001
CoopIS 2001
DASFAA 2001
DASFAA 2000
DBPL 2001
Data Engineering Bul
DEXA_EC-WEB 2001
DMKD 2001
DPDJ 2001
HYPERTEXT 2001
ICDE 2001
ICDM 2001
ICDT 2001
JCDL 2001
KDD 2001
KDD_EXPLORATIONS 20
KRDB 2001
MDM 2001
MIR 2001
MIS 2001
RIDE 2001
SBBD 2001
SIGIR 2001
SIGIR FORUM 2001
SSDBM 2001
SSTD 2001
TODS 2001
TIME 2001
VLDB 2001
VLDBJ 2001
About DiSC 2002
Editorial Board
Acknowledgements
DiSC 2002 Production
ADVIS
DiSC'02 Feedback
DiSC'02 Sitemap
Search DiSC'02
<<<Author Index>>>
Copyright Notice

Chung Keung Poon

Papers on DiSC'02


Orthogonal Range Queries in OLAP

Publications


Note: Links lead to the DBLP on the Web.

Chung Keung Poon

14 Chung Keung Poon: Orthogonal Range Queries in OLAP. ICDT 2001 : 361-374

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. TCS 237 (1-2): 327-345 (2000)

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)

8 Chung Keung Poon, Binhai Zhu , Francis Y. L. Chin : A Polynomial Time Solution for Labeling a Rectlinear Map. Information Processing Letters 65 (4): 201-207 (1998)

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. Information Processing Letters 62 (3): 153-159 (1997)

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 M. Y. Chan , Francis Y. L. Chin , Chung Keung Poon: Optimal Simulation of Full Binary Trees on Faulty Hypercubes. IEEE Transactions on Parallel and Distributed Systems 6 (3): 269-286 (1995)

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)

1 Mee Yee Chan , Francis Y. Chin , Chung Keung Poon: Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes. ISA 1991 : 241-250




DiSC'02 © 2003 Association for Computing Machinery