| 2009 |
|---|
| 134 | EE | Ho-Leung Chan,
Jeff Edmonds,
Tak Wah Lam,
Lap-Kei Lee,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy.
STACS 2009: 255-264 |
| 133 | EE | Ho-Leung Chan,
Jeff Edmonds,
Tak Wah Lam,
Lap-Kei Lee,
Alberto Marchetti-Spaccamela,
Kirk Pruhs:
Nonclairvoyant Speed Scaling for Flow and Energy
CoRR abs/0902.1260: (2009) |
| 132 | EE | Thomas K. F. Wong,
Tak Wah Lam,
P. Y. Chan,
Siu-Ming Yiu:
Correcting short reads with high error rates for improved sequencing result.
IJBRA 5(2): 224-237 (2009) |
| 2008 |
|---|
| 131 | EE | Thomas K. F. Wong,
Y. S. Chiu,
Tak Wah Lam,
Siu-Ming Yiu:
A Memory Efficient Algorithm for Structural Alignment of RNAs with Embedded Simple Pseudoknots.
APBC 2008: 89-100 |
| 130 | EE | Wing-Kai Hon,
Tak Wah Lam,
Rahul Shah,
Siu-Lung Tam,
Jeffrey Scott Vitter:
Compressed Index for Dictionary Matching.
DCC 2008: 23-32 |
| 129 | EE | Tak Wah Lam,
Lap-Kei Lee,
Isaac Kar-Keung To,
Prudence W. H. Wong:
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count.
ESA 2008: 647-659 |
| 128 | EE | Nikhil Bansal,
Ho-Leung Chan,
Tak Wah Lam,
Lap-Kei Lee:
Scheduling for Speed Bounded Processors.
ICALP (1) 2008: 409-420 |
| 127 | EE | Tak Wah Lam,
Lap-Kei Lee,
Isaac Kar-Keung To,
Prudence W. H. Wong:
Competitive non-migratory scheduling for flow time and energy.
SPAA 2008: 256-264 |
| 126 | EE | Tak Wah Lam:
Parallel Connectivity and Minimum Spanning Trees.
Encyclopedia of Algorithms 2008 |
| 125 | EE | Tak Wah Lam,
Wing-Kin Sung,
Swee-Seong Wong:
Improved Approximate String Matching Using Compressed Suffix Data Structures.
Algorithmica 51(3): 298-314 (2008) |
| 124 | EE | Tak Wah Lam,
Wing-Kin Sung,
Siu-Lung Tam,
Chi-Kwong Wong,
Siu-Ming Yiu:
Compressed indexing and local alignment of DNA.
Bioinformatics 24(6): 791-797 (2008) |
| 123 | EE | Tak Wah Lam,
Lap-Kei Lee,
Isaac Kar-Keung To,
Prudence W. H. Wong:
Nonmigratory Multiprocessor Scheduling for Response Time and Energy.
IEEE Trans. Parallel Distrib. Syst. 19(11): 1527-1539 (2008) |
| 122 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Prudence W. H. Wong,
Siu-Ming Yiu:
Non-overlapping Common Substrings Allowing Mutations.
Mathematics in Computer Science 1(4): 543-555 (2008) |
| 121 | EE | Ho-Leung Chan,
Tak Wah Lam,
Kin-Shing Liu:
Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling.
SIAM J. Comput. 37(5): 1595-1612 (2008) |
| 120 | EE | Joseph Wun-Tat Chan,
Tak Wah Lam,
Prudence W. H. Wong:
Dynamic bin packing of unit fractions items.
Theor. Comput. Sci. 409(3): 521-529 (2008) |
| 2007 |
|---|
| 119 | EE | Ho-Leung Chan,
Tak Wah Lam,
Prudence W. H. Wong:
Efficiency of Data Distribution in BitTorrent-Like Systems.
AAIM 2007: 378-388 |
| 118 | | Thomas K. F. Wong,
Tak Wah Lam,
W. L. Yang,
Siu-Ming Yiu:
Finding Alternative Splicing Patterns with Strong Support From Expressed Sequences.
BIOCOMP 2007: 153-158 |
| 117 | EE | Tak Wah Lam,
Wing-Kin Sung,
Siu-Lung Tam,
Chi-Kwong Wong,
Siu-Ming Yiu:
An Experimental Study of Compressed Indexing and Local Alignments of DNA.
COCOA 2007: 242-254 |
| 116 | EE | Wing-Kai Hon,
Tak Wah Lam,
Rahul Shah,
Siu-Lung Tam,
Jeffrey Scott Vitter:
Cache-Oblivious Index for Approximate String Matching.
CPM 2007: 40-51 |
| 115 | EE | Tak Wah Lam,
Lap-Kei Lee,
Isaac Kar-Keung To,
Prudence W. H. Wong:
Energy Efficient Deadline Scheduling in Two Processor Systems.
ISAAC 2007: 476-487 |
| 114 | EE | Tak Wah Lam,
Wing-Kin Sung,
Siu-Lung Tam,
Siu-Ming Yiu:
Space Efficient Indexes for String Matching with Don't Cares.
ISAAC 2007: 846-857 |
| 113 | EE | Ho-Leung Chan,
Wun-Tat Chan,
Tak Wah Lam,
Lap-Kei Lee,
Kin-Sum Mak,
Prudence W. H. Wong:
Energy efficient online deadline scheduling.
SODA 2007: 795-804 |
| 112 | EE | Joseph Wun-Tat Chan,
Tak Wah Lam,
Kin-Sum Mak,
Prudence W. H. Wong:
Online Deadline Scheduling with Bounded Energy Efficiency.
TAMC 2007: 416-427 |
| 111 | EE | Ho-Leung Chan,
Wing-Kai Hon,
Tak Wah Lam,
Kunihiko Sadakane:
Compressed indexes for dynamic text collections.
ACM Transactions on Algorithms 3(2): (2007) |
| 110 | EE | Wing-Kai Hon,
Tak Wah Lam,
Kunihiko Sadakane,
Wing-Kin Sung,
Siu-Ming Yiu:
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays.
Algorithmica 48(1): 23-36 (2007) |
| 2006 |
|---|
| 109 | EE | P. Y. Chan,
Tak Wah Lam,
Siu-Ming Yiu:
A More Accurate and Efficient Whole Genome Phylogeny.
APBC 2006: 337-352 |
| 108 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Lung Tam,
Swee-Seong Wong:
A Linear Size Index for Approximate Pattern Matching.
CPM 2006: 49-59 |
| 107 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Lung Tam,
Swee-Seong Wong:
Compressed Indexes for Approximate String Matching.
ESA 2006: 208-219 |
| 106 | EE | Ho-Leung Chan,
Tak Wah Lam,
Kin-Shing Liu:
Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling.
SODA 2006: 334-343 |
| 105 | EE | Ho-Leung Chan,
Jesper Jansson,
Tak Wah Lam,
Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.
J. Bioinformatics and Computational Biology 4(4): 807-832 (2006) |
| 104 | EE | Trinh N. D. Huynh,
Wing-Kai Hon,
Tak Wah Lam,
Wing-Kin Sung:
Approximate string matching using compressed suffix arrays.
Theor. Comput. Sci. 352(1-3): 240-249 (2006) |
| 103 | EE | Wun-Tat Chan,
Tak Wah Lam,
Kin-Shing Liu,
Prudence W. H. Wong:
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling.
Theor. Comput. Sci. 359(1-3): 430-439 (2006) |
| 2005 |
|---|
| 102 | EE | Siu-Ming Yiu,
P. Y. Chan,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting,
Prudence W. H. Wong:
Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness.
APBC 2005: 1-10 |
| 101 | EE | Wun-Tat Chan,
Tak Wah Lam,
Prudence W. H. Wong:
Dynamic Bin Packing of Unit Fractions Items.
ICALP 2005: 614-626 |
| 100 | EE | Tak Wah Lam,
Wing-Kin Sung,
Swee-Seong Wong:
Improved Approximate String Matching Using Compressed Suffix Data Structures.
ISAAC 2005: 339-348 |
| 99 | EE | Ho-Leung Chan,
Jesper Jansson,
Tak Wah Lam,
Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.
MFCS 2005: 224-235 |
| 98 | EE | Wun-Tat Chan,
Tak Wah Lam,
Kin-Shing Liu,
Prudence W. H. Wong:
New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling.
MFCS 2005: 236-247 |
| 97 | EE | Ho-Leung Chan,
Wing-Kai Hon,
Tak Wah Lam,
Kunihiko Sadakane:
Dynamic dictionary matching and compressed suffix trees.
SODA 2005: 13-22 |
| 96 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Prudence W. H. Wong,
Siu-Ming Yiu,
X. Fan:
The mutated subsequence problem and locating conserved genes.
Bioinformatics 21(10): 2271-2278 (2005) |
| 95 | EE | Siu-Ming Yiu,
Prudence W. H. Wong,
Tak Wah Lam,
Y. C. Mui,
H. F. Kung,
Marie Lin,
Y. T. Cheung:
Filtering of Ineffective siRNAs and Improved siRNA Design Tool.
Bioinformatics 21(2): 144-151 (2005) |
| 94 | 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) |
| 93 | EE | Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
A Tighter Extra-Resource Analysis of Online Deadline Scheduling.
J. Comb. Optim. 9(2): 157-165 (2005) |
| 92 | EE | Ho-Leung Chan,
Tak Wah Lam,
Kar-Keung To:
Nonmigratory Online Deadline Scheduling on Multiprocessors.
SIAM J. Comput. 34(3): 669-682 (2005) |
| 91 | EE | Wun-Tat Chan,
Tak Wah Lam,
Hing-Fung Ting,
Prudence W. H. Wong:
On-line Stream Merging with Max Span and Min Coverage.
Theory Comput. Syst. 38(4): 461-479 (2005) |
| 2004 |
|---|
| 90 | | Wing-Kai Hon,
Tak Wah Lam,
Wing-Kin Sung,
Wai-Leuk Tse,
Chi-Kwong Wong,
Siu-Ming Yiu:
Practical aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences.
ALENEX/ANALC 2004: 31-38 |
| 89 | EE | Prudence W. H. Wong,
Tak Wah Lam,
Y. C. Mui,
Siu-Ming Yiu,
H. F. Kung,
Marie Lin,
Y. T. Cheung:
Filtering of Ineffective siRNAs and Improved siRNA Design Tool.
APBC 2004: 247-255 |
| 88 | EE | Ho-Leung Chan,
Tak Wah Lam,
Wing-Kin Sung,
Prudence W. H. Wong,
Siu-Ming Yiu:
A Mutation-Sensitive Approach for Locating Conserved Gene Pairs between Related Species.
BIBE 2004: 545-552 |
| 87 | EE | Wun-Tat Chan,
Tak Wah Lam,
Hing-Fung Ting,
Prudence W. H. Wong:
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation.
COCOON 2004: 210-218 |
| 86 | EE | Trinh N. D. Huynh,
Wing-Kai Hon,
Tak Wah Lam,
Wing-Kin Sung:
Approximate String Matching Using Compressed Suffix Arrays.
CPM 2004: 434-444 |
| 85 | EE | Ho-Leung Chan,
Wing-Kai Hon,
Tak Wah Lam:
Compressed Index for a Dynamic Collection of Texts.
CPM 2004: 445-456 |
| 84 | EE | Wing-Kai Hon,
Tak Wah Lam,
Kunihiko Sadakane,
Wing-Kin Sung,
Siu-Ming Yiu:
Compressed Index for Dynamic Text.
Data Compression Conference 2004: 102-111 |
| 83 | 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 |
| 82 | EE | Ho-Leung Chan,
Tak Wah Lam,
Kar-Keung To:
Non-migratory online deadline scheduling on multiprocessors.
SODA 2004: 970-979 |
| 81 | EE | Prudence W. H. Wong,
Tak Wah Lam,
N. Lu,
Hing-Fung Ting,
Siu-Ming Yiu:
An efficient algorithm for optimizing whole genome alignment with noise.
Bioinformatics 20(16): 2676-2684 (2004) |
| 80 | EE | Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To,
Prudence W. H. Wong:
Aggressive Online Deadline Scheduling.
Electr. Notes Theor. Comput. Sci. 91: 148-157 (2004) |
| 79 | EE | Wing-Kai Hon,
Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Ming Yiu:
Non-shared edges and nearest neighbor interchanges revisited.
Inf. Process. Lett. 91(3): 129-134 (2004) |
| 78 | EE | Wing-Kai Hon,
Tak Wah Lam,
Siu-Ming Yiu,
Ming-Yang Kao,
Wing-Kin Sung:
Subtree Transfer Distance For Degree-D Phylogenies.
Int. J. Found. Comput. Sci. 15(6): 893-909 (2004) |
| 77 | EE | Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
Performance guarantee for EDF under overload.
J. Algorithms 52(2): 193-206 (2004) |
| 76 | EE | Chiu-Yuen Koo,
Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
Extra Processors versus Future Information in Optimal Deadline Scheduling.
Theory Comput. Syst. 37(3): 323-341 (2004) |
| 2003 |
|---|
| 75 | EE | Wun-Tat Chan,
Tak Wah Lam,
Hing-Fung Ting,
Prudence W. H. Wong:
On-Line Stream Merging, Max Span, and Min Coverage.
CIAC 2003: 70-82 |
| 74 | 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 |
| 73 | EE | Wing-Kai Hon,
Tak Wah Lam,
Kunihiko Sadakane,
Wing-Kin Sung:
Constructing Compressed Suffix Arrays with Large Alphabets.
ISAAC 2003: 240-249 |
| 72 | EE | Tak Wah Lam,
N. Lu,
Hing-Fung Ting,
Prudence W. H. Wong,
Siu-Ming Yiu:
Efficient Algorithms for Optimizing Whole Genome Alignment with Noise.
ISAAC 2003: 364-374 |
| 71 | | Ka Wong Chong,
Yijie Han,
Yoshihide Igarashi,
Tak Wah Lam:
Improving the efficiency of parallel minimum spanning tree algorithms.
Discrete Applied Mathematics 126(1): 33-54 (2003) |
| 70 | | Chiu-Yuen Koo,
Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
Competitive Deadline Scheduling via Additional or Faster Processors.
J. Scheduling 6(2): 213-223 (2003) |
| 69 | EE | Samuel Ieong,
Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Ming Yiu:
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs.
Journal of Computational Biology 10(6): 981-995 (2003) |
| 68 | EE | Chiu-Yuen Koo,
Tak Wah Lam,
Tsuen-Wan Ngan,
Kunihiko Sadakane,
Kar-Keung To:
On-line scheduling with tight deadlines.
Theor. Comput. Sci. 295: 251-261 (2003) |
| 67 | EE | Wun-Tat Chan,
Tak Wah Lam,
Hing-Fung Ting,
Prudence W. H. Wong:
On-line stream merging in a general setting.
Theor. Comput. Sci. 296(1): 27-46 (2003) |
| 2002 |
|---|
| 66 | EE | Tak Wah Lam,
Kunihiko Sadakane,
Wing-Kin Sung,
Siu-Ming Yiu:
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays.
COCOON 2002: 401-410 |
| 65 | EE | Wun-Tat Chan,
Tak Wah Lam,
Hing-Fung Ting,
Prudence W. H. Wong:
Competitive Analysis of On-line Stream Merging Algorithms.
MFCS 2002: 188-200 |
| 64 | EE | Chiu-Yuen Koo,
Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
Extra processors versus future information in optimal deadline scheduling.
SPAA 2002: 133-142 |
| 63 | EE | Wun-Tat Chan,
Tak Wah Lam,
Hing-Fung Ting,
Prudence W. H. Wong:
A unified analysis of hot video schedulers.
STOC 2002: 179-188 |
| 62 | EE | Wing-Kai Hon,
Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Ming Yiu:
Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers
CoRR cs.DS/0211009: (2002) |
| 61 | | Wing-Kin Sung,
David Yang,
Siu-Ming Yiu,
David Wai-Lok Cheung,
Wai-Shing Ho,
Tak Wah Lam:
Automatic construction of online catalog topologies.
IEEE Transactions on Systems, Man, and Cybernetics, Part C 32(4): 382-391 (2002) |
| 60 | EE | Tak Wah Lam,
Hing-Fung Ting,
Kar-Keung To,
Prudence W. H. Wong:
On-line load balancing of temporary tasks revisited.
Theor. Comput. Sci. 270(1-2): 325-340 (2002) |
| 2001 |
|---|
| 59 | | Samuel Ieong,
Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Ming Yiu:
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs.
BIBE 2001: 183-190 |
| 58 | EE | Wun-Tat Chan,
Tak Wah Lam,
Hing-Fung Ting,
Prudence W. H. Wong:
Improved On-Line Stream Merging: From a Restricted to a General Setting.
COCOON 2001: 432-442 |
| 57 | EE | Wing-Kin Sung,
David Yang,
Siu-Ming Yiu,
Wai-Shing Ho,
David Wai-Lok Cheung,
Tak Wah Lam:
Automatic Construction of Online Catalog Topologies.
EC-Web 2001: 216-225 |
| 56 | | Wun-Tat Chan,
Tak Wah Lam,
Hing-Fung Ting,
Prudence W. H. Wong:
An 5-competitive on-line scheduler for merging video streams.
IPDPS 2001: 201 |
| 55 | | Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
On the speed requirement for optimal deadline scheduling in overloaded systems.
IPDPS 2001: 202 |
| 54 | EE | Chiu-Yuen Koo,
Tak Wah Lam,
Tsuen-Wan Ngan,
Kar-Keung To:
On-Line Scheduling with Tight Deadlines.
MFCS 2001: 464-473 |
| 53 | EE | Tak Wah Lam,
Kar-Keung To:
Performance guarentee for online deadline scheduling in the presence of overload.
SODA 2001: 755-764 |
| 52 | EE | Tak Wah Lam,
Fung Ling Yue:
Optimal Edge Ranking of Trees in Linear Time.
Algorithmica 30(1): 12-33 (2001) |
| 51 | EE | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
CoRR cs.CE/0101031: (2001) |
| 50 | EE | Samuel Ieong,
Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Siu-Ming Yiu:
Predicting RNA Secondary Structures with Arbitrary Pseudoknots by Maximizing the Number of Stacking Pairs
CoRR cs.CE/0111051: (2001) |
| 49 | EE | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
CoRR cs.CV/0101010: (2001) |
| 48 | | Wing-Kai Hon,
Tak Wah Lam:
Approximating the Nearest Neighbor Intercharge Distance for Non-Uniform-Degree Evolutionary Trees.
Int. J. Found. Comput. Sci. 12(4): 533-550 (2001) |
| 47 | EE | Ka Wong Chong,
Yijie Han,
Tak Wah Lam:
Concurrent threads and optimal parallel minimum spanning trees algorithm.
J. ACM 48(2): 297-323 (2001) |
| 46 | | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings.
J. Algorithms 40(2): 212-233 (2001) |
| 45 | EE | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
A Decomposition Theorem for Maximum Weight Bipartite Matchings.
SIAM J. Comput. 31(1): 18-26 (2001) |
| 2000 |
|---|
| 44 | EE | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
A Faster and Unifying Algorithm for Comparing Trees.
CPM 2000: 129-142 |
| 43 | EE | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison.
ISAAC 2000: 479-490 |
| 42 | EE | Wing-Kai Hon,
Ming-Yang Kao,
Tak Wah Lam:
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers.
ISAAC 2000: 527-538 |
| 41 | EE | David Yang,
Wing-Kin Sung,
Siu-Ming Yiu,
David Wai-Lok Cheung,
Wai-Shing Ho,
Tak Wah Lam,
Sau Dan Lee:
Construction of Online Catalog Topologies Using Decision Trees.
WECWIS 2000: 223-230 |
| 40 | EE | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
A Decomposition Theorem for Maximum Weight Bipartite Matchings
CoRR cs.DS/0011015: (2000) |
| 39 | | Tak Wah Lam,
Hing-Fung Ting:
Selecting the k largest elements with parity tests.
Discrete Applied Mathematics 101(1-3): 187-196 (2000) |
| 38 | | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees.
SIAM J. Comput. 30(2): 602-624 (2000) |
| 1999 |
|---|
| 37 | EE | David Wai-Lok Cheung,
Bo Zhou,
Ben Kao,
Hongjun Lu,
Tak Wah Lam,
Hing-Fung Ting:
Requirement-Based Data Cube Schema Design.
CIKM 1999: 162-169 |
| 36 | EE | Ka Wong Chong,
Yijie Han,
Yoshihide Igarashi,
Tak Wah Lam:
Improving Parallel Computation with Fast Integer Sorting.
COCOON 1999: 452-461 |
| 35 | EE | Wing-Kai Hon,
Tak Wah Lam:
Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees.
COCOON 1999: 61-70 |
| 34 | EE | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees.
ESA 1999: 438-449 |
| 33 | EE | Ka Wong Chong,
Yijie Han,
Tak Wah Lam:
On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees.
SODA 1999: 225-234 |
| 32 | EE | Tak Wah Lam,
Kar-Keung To:
Trade-offs Between Speed and Processor in Hard-Deadline Scheduling.
SODA 1999: 623-632 |
| 1998 |
|---|
| 31 | | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
Default-Sensitive PreProcessings for Finding Maxima.
CATS 1998: 107-120 |
| 30 | EE | Tak Wah Lam,
Hing-Fung Ting:
Selecting the k Largest Elements with Parity Tests.
ISAAC 1998: 189-198 |
| 29 | | Tak Wah Lam,
Fung Ling Yue:
Optimal Edge Ranking of Trees in Linear Time.
SODA 1998: 436-445 |
| 28 | | Ka Wong Chong,
Tak Wah Lam:
Approximating Biconnectivity in Parallel.
Algorithmica 21(4): 395-410 (1998) |
| 27 | EE | Tak Wah Lam,
Fung Ling Yue:
Edge Ranking of Graphs Is Hard.
Discrete Applied Mathematics 85(1): 71-86 (1998) |
| 26 | EE | Tak Wah Lam,
Ka Hing Lee:
An Improved Scheme for Set Equality Testing and Updating.
Theor. Comput. Sci. 201(1-2): 85-97 (1998) |
| 1997 |
|---|
| 25 | | Ming-Yang Kao,
Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
All-Cavity Maximum Matchings.
ISAAC 1997: 364-373 |
| 24 | EE | Ming-Yang Kao,
Tak Wah Lam,
Teresa M. Przytycka,
Wing-Kin Sung,
Hing-Fung Ting:
General Techniques for Comparing Unrooted Evolutionary Trees.
STOC 1997: 54-65 |
| 23 | EE | Ying Choi,
Tak Wah Lam:
Dynamic Suffix Tree and Two-Dimensional Texts Management.
Inf. Process. Lett. 61(4): 213-220 (1997) |
| 1996 |
|---|
| 22 | | Ka Wong Chong,
Tak Wah Lam:
Towards More Precise Parallel Biconnectivity Approximation.
ISAAC 1996: 223-232 |
| 21 | | Ying Choi,
Tak Wah Lam:
Two-Dimensional Dynamic Dictionary Matching.
ISAAC 1996: 85-94 |
| 20 | | Ka Wong Chong,
Tak Wah Lam:
Improving Biconnectivity Approximation via Local Optimization.
SODA 1996: 26-35 |
| 19 | | Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.
SWAT 1996: 124-135 |
| 18 | | Tak Wah Lam,
Wing-Kin Sung,
Hing-Fung Ting:
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.
Nord. J. Comput. 3(4): 295-322 (1996) |
| 1995 |
|---|
| 17 | | Tak Wah Lam,
Ka Hing Lee:
Efficient Equality-Testing and Updating of Sets.
ASIAN 1995: 48-58 |
| 16 | | Ying Choi,
Tak Wah Lam:
Two-Dimensional Pattern Matching on a Dynamic Library of Texts.
COCOON 1995: 530-538 |
| 15 | EE | Ka Wong Chong,
Tak Wah Lam:
Approximating Biconnectivity in Parallel.
SPAA 1995: 224-233 |
| 14 | | Ka Wong Chong,
Tak Wah Lam:
Finding Connected Components in O(log n log log n) Time on the EREW PRAM.
J. Algorithms 18(3): 378-402 (1995) |
| 1994 |
|---|
| 13 | | Tak Wah Lam,
Ka Hing Lee:
On Set Equality-Testing.
CIAC 1994: 179-191 |
| 1993 |
|---|
| 12 | | Ka Wong Chong,
Tak Wah Lam:
Finding Connected Components in O(log n log log n) Time on the EREW PRAM.
SODA 1993: 11-20 |
| 11 | | Tak Wah Lam,
Kwong-fai Chan:
Finding Least-Weight Subsequences with Fewer Processors.
Algorithmica 9(6): 615-628 (1993) |
| 10 | | Kwong-fai Chan,
Tak Wah Lam:
An on-line algorithm for navigating in unknown environment.
Int. J. Comput. Geometry Appl. 3(3): 227-244 (1993) |
| 1992 |
|---|
| 9 | | Tak Wah Lam,
Ka Hing Lee:
The Implicit Dictionary Problem Revisited.
ISAAC 1992: 479-488 |
| 8 | | Tak Wah Lam,
Walter L. Ruzzo:
Results on Communication Complexity Classes.
J. Comput. Syst. Sci. 44(2): 324-342 (1992) |
| 7 | | Tak Wah Lam,
Prasoon Tiwari,
Martin Tompa:
Trade-Offs between Communication and Space.
J. Comput. Syst. Sci. 45(3): 296-315 (1992) |
| 1991 |
|---|
| 6 | | Kwong-fai Chan,
Tak Wah Lam:
An On-Line Algorithm for Navigating in Unknown Terrain.
ISA 1991: 127-136 |
| 1990 |
|---|
| 5 | | Kwong-fai Chan,
Tak Wah Lam:
Finding Least-Weight Subsequences with Fewer Processors.
SIGAL International Symposium on Algorithms 1990: 318-327 |
| 1989 |
|---|
| 4 | | Wai Wan Tsang,
Tak Wah Lam,
Francis Y. L. Chin:
An Optimal EREW Parallel Algorithm for Parenthesis Matching.
ICPP (3) 1989: 185-192 |
| 3 | EE | Tak Wah Lam,
Walter L. Ruzzo:
The Power of Parallel Pointer Manipulation.
SPAA 1989: 92-102 |
| 2 | | Tak Wah Lam,
Prasoon Tiwari,
Martin Tompa:
Tradeoffs Between Communication and Space
STOC 1989: 217-226 |
| 1 | | Tak Wah Lam,
Walter L. Ruzzo:
Results on Communication Complexity Classes.
Structure in Complexity Theory Conference 1989: 148-157 |
