Search the dblp DataBase
Tak Wah Lam :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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. [Citation Graph (0, 0)][DBLP ] ALENEX/ANALC, 2004, pp:31-38 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] APBC, 2004, pp:247-255 [Conf ] P. Y. Chan , Tak Wah Lam , Siu-Ming Yiu A More Accurate and Efficient Whole Genome Phylogeny. [Citation Graph (0, 0)][DBLP ] APBC, 2006, pp:337-352 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] APBC, 2005, pp:1-10 [Conf ] Tak Wah Lam , Ka Hing Lee Efficient Equality-Testing and Updating of Sets. [Citation Graph (0, 0)][DBLP ] ASIAN, 1995, pp:48-58 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] BIBE, 2004, pp:545-552 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] BIBE, 2001, pp:183-190 [Conf ] Tak Wah Lam , Ka Hing Lee On Set Equality-Testing. [Citation Graph (0, 0)][DBLP ] CIAC, 1994, pp:179-191 [Conf ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong On-Line Stream Merging, Max Span, and Min Coverage. [Citation Graph (0, 0)][DBLP ] CIAC, 2003, pp:70-82 [Conf ] David Wai-Lok Cheung , Bo Zhou , Ben Kao , Hongjun Lu , Tak Wah Lam , Hing-Fung Ting Requirement-Based Data Cube Schema Design. [Citation Graph (0, 0)][DBLP ] CIKM, 1999, pp:162-169 [Conf ] Tak Wah Lam , Walter L. Ruzzo Results on Communication Complexity Classes. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1989, pp:148-157 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:432-442 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] COCOON, 2004, pp:210-218 [Conf ] Ying Choi , Tak Wah Lam Two-Dimensional Pattern Matching on a Dynamic Library of Texts. [Citation Graph (0, 0)][DBLP ] COCOON, 1995, pp:530-538 [Conf ] Ka Wong Chong , Yijie Han , Yoshihide Igarashi , Tak Wah Lam Improving Parallel Computation with Fast Integer Sorting. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:452-461 [Conf ] Wing-Kai Hon , Tak Wah Lam Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:61-70 [Conf ] Tak Wah Lam , Kunihiko Sadakane , Wing-Kin Sung , Siu-Ming Yiu A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. [Citation Graph (0, 0)][DBLP ] COCOON, 2002, pp:401-410 [Conf ] Ho-Leung Chan , Wing-Kai Hon , Tak Wah Lam Compressed Index for a Dynamic Collection of Texts. [Citation Graph (0, 0)][DBLP ] CPM, 2004, pp:445-456 [Conf ] Ho-Leung Chan , Tak Wah Lam , Wing-Kin Sung , Siu-Lung Tam , Swee-Seong Wong A Linear Size Index for Approximate Pattern Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:49-59 [Conf ] Trinh N. D. Huynh , Wing-Kai Hon , Tak Wah Lam , Wing-Kin Sung Approximate String Matching Using Compressed Suffix Arrays. [Citation Graph (0, 0)][DBLP ] CPM, 2004, pp:434-444 [Conf ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting A Faster and Unifying Algorithm for Comparing Trees. [Citation Graph (0, 0)][DBLP ] CPM, 2000, pp:129-142 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] CSB, 2003, pp:337-346 [Conf ] Wing-Kai Hon , Tak Wah Lam , Kunihiko Sadakane , Wing-Kin Sung , Siu-Ming Yiu Compressed Index for Dynamic Text. [Citation Graph (0, 0)][DBLP ] Data Compression Conference, 2004, pp:102-111 [Conf ] Wing-Kin Sung , David Yang , Siu-Ming Yiu , Wai-Shing Ho , David Wai-Lok Cheung , Tak Wah Lam Automatic Construction of Online Catalog Topologies. [Citation Graph (0, 0)][DBLP ] EC-Web, 2001, pp:216-225 [Conf ] Ho-Leung Chan , Tak Wah Lam , Wing-Kin Sung , Siu-Lung Tam , Swee-Seong Wong Compressed Indexes for Approximate String Matching. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:208-219 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] ESA, 1999, pp:438-449 [Conf ] Wun-Tat Chan , Tak Wah Lam , Prudence W. H. Wong Dynamic Bin Packing of Unit Fractions Items. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:614-626 [Conf ] Wai Wan Tsang , Tak Wah Lam , Francis Y. L. Chin An Optimal EREW Parallel Algorithm for Parenthesis Matching. [Citation Graph (0, 0)][DBLP ] ICPP (3), 1989, pp:185-192 [Conf ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong An 5-competitive on-line scheduler for merging video streams. [Citation Graph (0, 0)][DBLP ] IPDPS, 2001, pp:201- [Conf ] Tak Wah Lam , Tsuen-Wan Ngan , Kar-Keung To On the speed requirement for optimal deadline scheduling in overloaded systems. [Citation Graph (0, 0)][DBLP ] IPDPS, 2001, pp:202- [Conf ] Kwong-fai Chan , Tak Wah Lam An On-Line Algorithm for Navigating in Unknown Terrain. [Citation Graph (0, 0)][DBLP ] ISA, 1991, pp:127-136 [Conf ] Ying Choi , Tak Wah Lam Two-Dimensional Dynamic Dictionary Matching. [Citation Graph (0, 0)][DBLP ] ISAAC, 1996, pp:85-94 [Conf ] Ka Wong Chong , Tak Wah Lam Towards More Precise Parallel Biconnectivity Approximation. [Citation Graph (0, 0)][DBLP ] ISAAC, 1996, pp:223-232 [Conf ] Wing-Kai Hon , Ming-Yang Kao , Tak Wah Lam Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers. [Citation Graph (0, 0)][DBLP ] ISAAC, 2000, pp:527-538 [Conf ] Wing-Kai Hon , Tak Wah Lam , Kunihiko Sadakane , Wing-Kin Sung Constructing Compressed Suffix Arrays with Large Alphabets. [Citation Graph (0, 0)][DBLP ] ISAAC, 2003, pp:240-249 [Conf ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. [Citation Graph (0, 0)][DBLP ] ISAAC, 2000, pp:479-490 [Conf ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting All-Cavity Maximum Matchings. [Citation Graph (0, 0)][DBLP ] ISAAC, 1997, pp:364-373 [Conf ] Tak Wah Lam , Ka Hing Lee The Implicit Dictionary Problem Revisited. [Citation Graph (0, 0)][DBLP ] ISAAC, 1992, pp:479-488 [Conf ] Tak Wah Lam , N. Lu , Hing-Fung Ting , Prudence W. H. Wong , Siu-Ming Yiu Efficient Algorithms for Optimizing Whole Genome Alignment with Noise. [Citation Graph (0, 0)][DBLP ] ISAAC, 2003, pp:364-374 [Conf ] Tak Wah Lam , Wing-Kin Sung , Swee-Seong Wong Improved Approximate String Matching Using Compressed Suffix Data Structures. [Citation Graph (0, 0)][DBLP ] ISAAC, 2005, pp:339-348 [Conf ] Tak Wah Lam , Hing-Fung Ting Selecting the k Largest Elements with Parity Tests. [Citation Graph (0, 0)][DBLP ] ISAAC, 1998, pp:189-198 [Conf ] Ho-Leung Chan , Jesper Jansson , Tak Wah Lam , Siu-Ming Yiu Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. [Citation Graph (0, 0)][DBLP ] MFCS, 2005, pp:224-235 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] MFCS, 2005, pp:236-247 [Conf ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong Competitive Analysis of On-line Stream Merging Algorithms. [Citation Graph (0, 0)][DBLP ] MFCS, 2002, pp:188-200 [Conf ] Chiu-Yuen Koo , Tak Wah Lam , Tsuen-Wan Ngan , Kar-Keung To On-Line Scheduling with Tight Deadlines. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:464-473 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] RECOMB, 2004, pp:125-132 [Conf ] Kwong-fai Chan , Tak Wah Lam Finding Least-Weight Subsequences with Fewer Processors. [Citation Graph (0, 0)][DBLP ] SIGAL International Symposium on Algorithms, 1990, pp:318-327 [Conf ] Ho-Leung Chan , Wing-Kai Hon , Tak Wah Lam , Kunihiko Sadakane Dynamic dictionary matching and compressed suffix trees. [Citation Graph (0, 0)][DBLP ] SODA, 2005, pp:13-22 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:334-343 [Conf ] Ho-Leung Chan , Tak Wah Lam , Kar-Keung To Non-migratory online deadline scheduling on multiprocessors. [Citation Graph (0, 0)][DBLP ] SODA, 2004, pp:970-979 [Conf ] Ka Wong Chong , Yijie Han , Tak Wah Lam On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:225-234 [Conf ] Ka Wong Chong , Tak Wah Lam Finding Connected Components in O(log n log log n) Time on the EREW PRAM. [Citation Graph (0, 0)][DBLP ] SODA, 1993, pp:11-20 [Conf ] Ka Wong Chong , Tak Wah Lam Improving Biconnectivity Approximation via Local Optimization. [Citation Graph (0, 0)][DBLP ] SODA, 1996, pp:26-35 [Conf ] Tak Wah Lam , Kar-Keung To Performance guarentee for online deadline scheduling in the presence of overload. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:755-764 [Conf ] Tak Wah Lam , Kar-Keung To Trade-offs Between Speed and Processor in Hard-Deadline Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:623-632 [Conf ] Tak Wah Lam , Fung Ling Yue Optimal Edge Ranking of Trees in Linear Time. [Citation Graph (0, 0)][DBLP ] SODA, 1998, pp:436-445 [Conf ] Ka Wong Chong , Tak Wah Lam Approximating Biconnectivity in Parallel. [Citation Graph (0, 0)][DBLP ] SPAA, 1995, pp:224-233 [Conf ] Chiu-Yuen Koo , Tak Wah Lam , Tsuen-Wan Ngan , Kar-Keung To Extra processors versus future information in optimal deadline scheduling. [Citation Graph (0, 0)][DBLP ] SPAA, 2002, pp:133-142 [Conf ] Tak Wah Lam , Walter L. Ruzzo The Power of Parallel Pointer Manipulation. [Citation Graph (0, 0)][DBLP ] SPAA, 1989, pp:92-102 [Conf ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong A unified analysis of hot video schedulers. [Citation Graph (0, 0)][DBLP ] STOC, 2002, pp:179-188 [Conf ] Ming-Yang Kao , Tak Wah Lam , Teresa M. Przytycka , Wing-Kin Sung , Hing-Fung Ting General Techniques for Comparing Unrooted Evolutionary Trees. [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:54-65 [Conf ] Tak Wah Lam , Prasoon Tiwari , Martin Tompa Tradeoffs Between Communication and Space [Citation Graph (0, 0)][DBLP ] STOC, 1989, pp:217-226 [Conf ] Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. [Citation Graph (0, 0)][DBLP ] SWAT, 1996, pp:124-135 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] WECWIS, 2000, pp:223-230 [Conf ] Ka Wong Chong , Tak Wah Lam Approximating Biconnectivity in Parallel. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1998, v:21, n:4, pp:395-410 [Journal ] Tak Wah Lam , Kwong-fai Chan Finding Least-Weight Subsequences with Fewer Processors. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1993, v:9, n:6, pp:615-628 [Journal ] Tak Wah Lam , Fung Ling Yue Optimal Edge Ranking of Trees in Linear Time. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:30, n:1, pp:12-33 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Bioinformatics, 2005, v:21, n:10, pp:2271-2278 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Bioinformatics, 2004, v:20, n:16, pp:2676-2684 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Bioinformatics, 2005, v:21, n:2, pp:144-151 [Journal ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] 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 [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] 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 [Citation Graph (0, 0)][DBLP ] CoRR, 2001, v:0, n:, pp:- [Journal ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting A Decomposition Theorem for Maximum Weight Bipartite Matchings [Citation Graph (0, 0)][DBLP ] CoRR, 2000, v:0, n:, pp:- [Journal ] 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 [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Ka Wong Chong , Yijie Han , Yoshihide Igarashi , Tak Wah Lam Improving the efficiency of parallel minimum spanning tree algorithms. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:126, n:1, pp:33-54 [Journal ] Tak Wah Lam , Hing-Fung Ting Selecting the k largest elements with parity tests. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:187-196 [Journal ] Tak Wah Lam , Fung Ling Yue Edge Ranking of Graphs Is Hard. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1998, v:85, n:1, pp:71-86 [Journal ] Tak Wah Lam , Tsuen-Wan Ngan , Kar-Keung To , Prudence W. H. Wong Aggressive Online Deadline Scheduling. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2004, v:91, n:, pp:148-157 [Journal ] Kwong-fai Chan , Tak Wah Lam An on-line algorithm for navigating in unknown environment. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 1993, v:3, n:3, pp:227-244 [Journal ] Wing-Kai Hon , Tak Wah Lam Approximating the Nearest Neighbor Intercharge Distance for Non-Uniform-Degree Evolutionary Trees. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:533-550 [Journal ] Wing-Kai Hon , Tak Wah Lam , Siu-Ming Yiu , Ming-Yang Kao , Wing-Kin Sung Subtree Transfer Distance For Degree-D Phylogenies. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2004, v:15, n:6, pp:893-909 [Journal ] Ying Choi , Tak Wah Lam Dynamic Suffix Tree and Two-Dimensional Texts Management. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:61, n:4, pp:213-220 [Journal ] Wing-Kai Hon , Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Siu-Ming Yiu Non-shared edges and nearest neighbor interchanges revisited. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2004, v:91, n:3, pp:129-134 [Journal ] Ka Wong Chong , Yijie Han , Tak Wah Lam Concurrent threads and optimal parallel minimum spanning trees algorithm. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:2, pp:297-323 [Journal ] Ka Wong Chong , Tak Wah Lam Finding Connected Components in O(log n log log n) Time on the EREW PRAM. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1995, v:18, n:3, pp:378-402 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:40, n:2, pp:212-233 [Journal ] Tak Wah Lam , Tsuen-Wan Ngan , Kar-Keung To Performance guarantee for EDF under overload. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2004, v:52, n:2, pp:193-206 [Journal ] Francis Y. L. Chin , N. L. Ho , Tak Wah Lam , Prudence W. H. Wong Efficient Constrained Multiple Sequence Alignment with Performance Guarantee. [Citation Graph (0, 0)][DBLP ] J. Bioinformatics and Computational Biology, 2005, v:3, n:1, pp:1-18 [Journal ] Ho-Leung Chan , Jesper Jansson , Tak Wah Lam , Siu-Ming Yiu Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. [Citation Graph (0, 0)][DBLP ] J. Bioinformatics and Computational Biology, 2006, v:4, n:4, pp:807-832 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 2003, v:10, n:6, pp:981-995 [Journal ] Tak Wah Lam , Tsuen-Wan Ngan , Kar-Keung To A Tighter Extra-Resource Analysis of Online Deadline Scheduling. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2005, v:9, n:2, pp:157-165 [Journal ] Tak Wah Lam , Walter L. Ruzzo Results on Communication Complexity Classes. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1992, v:44, n:2, pp:324-342 [Journal ] Tak Wah Lam , Prasoon Tiwari , Martin Tompa Trade-Offs between Communication and Space. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1992, v:45, n:3, pp:296-315 [Journal ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong On-line Stream Merging with Max Span and Min Coverage. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2005, v:38, n:4, pp:461-479 [Journal ] Chiu-Yuen Koo , Tak Wah Lam , Tsuen-Wan Ngan , Kar-Keung To Extra Processors versus Future Information in Optimal Deadline Scheduling. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2004, v:37, n:3, pp:323-341 [Journal ] Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 1996, v:3, n:4, pp:295-322 [Journal ] Chiu-Yuen Koo , Tak Wah Lam , Tsuen-Wan Ngan , Kar-Keung To Competitive Deadline Scheduling via Additional or Faster Processors. [Citation Graph (0, 0)][DBLP ] J. Scheduling, 2003, v:6, n:2, pp:213-223 [Journal ] Ho-Leung Chan , Tak Wah Lam , Kar-Keung To Nonmigratory Online Deadline Scheduling on Multiprocessors. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:34, n:3, pp:669-682 [Journal ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:2, pp:602-624 [Journal ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting A Decomposition Theorem for Maximum Weight Bipartite Matchings. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2001, v:31, n:1, pp:18-26 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:359, n:1-3, pp:430-439 [Journal ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong On-line stream merging in a general setting. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:296, n:1, pp:27-46 [Journal ] Trinh N. D. Huynh , Wing-Kai Hon , Tak Wah Lam , Wing-Kin Sung Approximate string matching using compressed suffix arrays. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:240-249 [Journal ] Chiu-Yuen Koo , Tak Wah Lam , Tsuen-Wan Ngan , Kunihiko Sadakane , Kar-Keung To On-line scheduling with tight deadlines. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:, pp:251-261 [Journal ] Tak Wah Lam , Ka Hing Lee An Improved Scheme for Set Equality Testing and Updating. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:201, n:1-2, pp:85-97 [Journal ] Tak Wah Lam , Hing-Fung Ting , Kar-Keung To , Prudence W. H. Wong On-line load balancing of temporary tasks revisited. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:270, n:1-2, pp:325-340 [Journal ] Wing-Kin Sung , David Yang , Siu-Ming Yiu , David Wai-Lok Cheung , Wai-Shing Ho , Tak Wah Lam Automatic construction of online catalog topologies. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Systems, Man, and Cybernetics, Part C, 2002, v:32, n:4, pp:382-391 [Journal ] Ho-Leung Chan , Tak Wah Lam , Prudence W. H. Wong Efficiency of Data Distribution in BitTorrent-Like Systems. [Citation Graph (0, 0)][DBLP ] AAIM, 2007, pp:378-388 [Conf ] Wing-Kai Hon , Tak Wah Lam , Rahul Shah , Siu-Lung Tam , Jeffrey Scott Vitter Cache-Oblivious Index for Approximate String Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2007, pp:40-51 [Conf ] Ho-Leung Chan , Wun-Tat Chan , Tak Wah Lam , Lap-Kei Lee , Kin-Sum Mak , Prudence W. H. Wong Energy efficient online deadline scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:795-804 [Conf ] Joseph Wun-Tat Chan , Tak Wah Lam , Kin-Sum Mak , Prudence W. H. Wong Online Deadline Scheduling with Bounded Energy Efficiency. [Citation Graph (0, 0)][DBLP ] TAMC, 2007, pp:416-427 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] COCOA, 2007, pp:242-254 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2007, v:48, n:1, pp:23-36 [Journal ] Ho-Leung Chan , Wing-Kai Hon , Tak Wah Lam , Kunihiko Sadakane Compressed indexes for dynamic text collections. [Citation Graph (0, 0)][DBLP ] ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal ] Indexing Similar DNA Sequences. [Citation Graph (, )][DBLP ] A Memory Efficient Algorithm for Structural Alignment of RNAs with Embedded Simple Pseudoknots. [Citation Graph (, )][DBLP ] Finding Alternative Splicing Patterns with Strong Support From Expressed Sequences. [Citation Graph (, )][DBLP ] Default-Sensitive PreProcessings for Finding Maxima. [Citation Graph (, )][DBLP ] Compressed Index for Dictionary Matching. [Citation Graph (, )][DBLP ] Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count. [Citation Graph (, )][DBLP ] Non-clairvoyant Speed Scaling for Weighted Flow Time. [Citation Graph (, )][DBLP ] Sleep with Guilt and Work Faster to Minimize Flow Plus Energy. [Citation Graph (, )][DBLP ] Scheduling for Speed Bounded Processors. [Citation Graph (, )][DBLP ] Space Efficient Indexes for String Matching with Don't Cares. [Citation Graph (, )][DBLP ] Energy Efficient Deadline Scheduling in Two Processor Systems. [Citation Graph (, )][DBLP ] Succinct Index for Dynamic Dictionary Matching. [Citation Graph (, )][DBLP ] Competitive non-migratory scheduling for flow time and energy. [Citation Graph (, )][DBLP ] Succinct Text Indexing with Wildcards. [Citation Graph (, )][DBLP ] Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window. [Citation Graph (, )][DBLP ] Nonclairvoyant Speed Scaling for Flow and Energy. [Citation Graph (, )][DBLP ] Structural Alignment of RNA with Complex Pseudoknot Structure. [Citation Graph (, )][DBLP ] Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. [Citation Graph (, )][DBLP ] Local Structural Alignment of RNA with Affine Gap Model. [Citation Graph (, )][DBLP ] High Throughput Short Read Alignment via Bi-directional BWT. [Citation Graph (, )][DBLP ] The 2-Interval Pattern Matching Problems and Its Application to ncRNA Scanning. [Citation Graph (, )][DBLP ] Improved Approximate String Matching Using Compressed Suffix Data Structures. [Citation Graph (, )][DBLP ] Compressed indexing and local alignment of DNA. [Citation Graph (, )][DBLP ] SOAP2: an improved ultrafast tool for short read alignment. [Citation Graph (, )][DBLP ] Nonclairvoyant Speed Scaling for Flow and Energy [Citation Graph (, )][DBLP ] Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window [Citation Graph (, )][DBLP ] Search in 0.017secs, Finished in 0.023secs