![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Tak Wah Lam 50 Tak Wah Lam, Hing-Fung Ting , Kar-Keung To , Wai-Ha Wong : On-line load balancing of temporary tasks revisited. TCS 270 (1-2): 325-340 (2002) 49 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 48 Wun-Tat Chan , Tak Wah Lam, Hing-Fung Ting , Wai-Ha Wong : Improved On-Line Stream Merging: From a Restricted to a General Setting. COCOON 2001 : 432-442 47 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 46 Chiu-Yuen Koo , Tak Wah Lam, Tsuen-Wan Ngan , Kar-Keung To : On-Line Scheduling with Tight Deadlines. MFCS 2001 : 464-473 45 Tak Wah Lam, Kar-Keung To : Performance guarentee for online deadline scheduling in the presence of overload. SODA 2001 : 755-764 44 Tak Wah Lam, Fung Ling Yue : Optimal Edge Ranking of Trees in Linear Time. Algorithmica 30 (1): 12-33 (2001) 43 Wing-Kai Hon , Tak Wah Lam: Approximating the Nearest Neighbor Intercharge Distance for Non-Uniform-Degree Evolutionary Trees. International Journal of Foundations of Computer Science 12 (4): 533-550 (2001) 42 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) 41 Ka Wong Chong , Yijie Han , Tak Wah Lam: Concurrent threads and optimal parallel minimum spanning trees algorithm. JACM 48 (2): 297-323 (2001) 40 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) 39 Ming-Yang Kao , Tak Wah Lam, Wing-Kin Sung , Hing-Fung Ting : A Faster and Unifying Algorithm for Comparing Trees. CPM 2000 : 129-142 38 Ming-Yang Kao , Tak Wah Lam, Wing-Kin Sung , Hing-Fing Ting : Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison. ISAAC 2000 : 479-490 37 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 36 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 35 Tak Wah Lam, Hing-Fung Ting : Selecting the k largest elements with parity tests. Discrete Applied Mathematics 101 (1-3): 187-196 (2000) 34 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) 33 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 32 Ka Wong Chong , Yijie Han , Yoshihide Igarashi , Tak Wah Lam: Improving Parallel Computation with Fast Integer Sorting. COCOON 1999 : 452-461 31 Wing-Kai Hon , Tak Wah Lam: Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees. COCOON 1999 : 61-70 30 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 29 Ka Wong Chong , Yijie Han , Tak Wah Lam: On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees. SODA 1999 : 225-234 28 Tak Wah Lam, Kar-Keung To : Trade-offs Between Speed and Processor in Hard-Deadline Scheduling. SODA 1999 : 623-632 27 Tak Wah Lam, Hing-Fung Ting : Selecting the k Largest Elements with Parity Tests. ISAAC 1998 : 189-198 26 Tak Wah Lam, Fung Ling Yue : Optimal Edge Ranking of Trees in Linear Time. SODA 1998 : 436-445 25 Ka Wong Chong , Tak Wah Lam: Approximating Biconnectivity in Parallel. Algorithmica 21 (4): 395-410 (1998) 24 Tak Wah Lam, Ka Hing Lee : An Improved Scheme for Set Equality Testing and Updating. TCS 201 (1-2): 85-97 (1998) 23 Ming-Yang Kao , Tak Wah Lam, Wing-Kin Sung , Hing-Fung Ting : All-Cavity Maximum Matchings. ISAAC 1997 : 364-373 22 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 21 Y. Choi , Tak Wah Lam: Dynamic Suffix Tree and Two-Dimensional Texts Management. Information Processing Letters 61 (4): 213-220 (1997) 20 Ka Wong Chong , Tak Wah Lam: Towards More Precise Parallel Biconnectivity Approximation. ISAAC 1996 : 223-232 19 Ying Choi , Tak Wah Lam: Two-Dimensional Dynamic Dictionary Matching. ISAAC 1996 : 85-94 18 Ka Wong Chong , Tak Wah Lam: Improving Biconnectivity Approximation via Local Optimization. SODA 1996 : 26-35 17 Tak Wah Lam, Wing-Kin Sung , Hing-Fung Ting : Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. SWAT 1996 : 124-135 16 Tak Wah Lam, Ka Hing Lee : Efficient Equality-Testing and Updating of Sets. ASIAN 1995 : 48-58 15 Y. Choi , Tak Wah Lam: Two-Dimensional Pattern Matching on a Dynamic Library of Texts. COCOON 1995 : 530-538 14 Ka Wong Chong , Tak Wah Lam: Approximating Biconnectivity in Parallel. SPAA 1995 : 224-233 13 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) 12 Tak Wah Lam, Ka Hing Lee : On Set Equality-Testing. CIAC 1994 : 179-191 11 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 10 Tak Wah Lam, Kwong-fai Chan : Finding Least-Weight Subsequences with Fewer Processors. Algorithmica 9 (6): 615-628 (1993) 9 Kwong-fai Chan , Tak Wah Lam: An on-line algorithm for navigating in unknown environment. International Journal of Computational Geometry and Applications 3 (3): 227-244 (1993) 8 Tak Wah Lam, Ka Hing Lee : The Implicit Dictionary Problem Revisited. ISAAC 1992 : 479-488 7 Tak Wah Lam, Walter L. Ruzzo : Results on Communication Complexity Classes. JCSS 44 (2): 324-342 (1992) 6 Tak Wah Lam, Prasoon Tiwari , Martin Tompa : Trade-Offs between Communication and Space. JCSS 45 (3): 296-315 (1992) 5 Kwong-fai Chan , Tak Wah Lam: An On-Line Algorithm for Navigating in Unknown Terrain. ISA 1991 : 127-136 4 Kwong-fai Chan , Tak Wah Lam: Finding Least-Weight Subsequences with Fewer Processors. SIGAL International Symposium on Algorithms 1990 : 318-327 3 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 ![]() DiSC'02 © 2003 Association for Computing Machinery |