dblp.uni-trier.dewww.uni-trier.de

Hing-Fung Ting Vis

H. F. Ting

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
65EEFrancis Y. L. Chin, Hing-Fung Ting, Yong Zhang: Variable-Size Rectangle Covering. COCOA 2009: 145-154
64EEJoseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang: Online Tree Node Assignment with Resource Augmentation. COCOON 2009: 358-367
63EETak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Isaac Kar-Keung To, Prudence W. H. Wong: Sleep with Guilt and Work Faster to Minimize Flow Plus Energy. ICALP (1) 2009: 665-676
62EEXin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang: A New Upper Bound on 2D Online Bin Packing CoRR abs/0906.0409: (2009)
61EERegant Y. S. Hung, Hing-Fung Ting: A Near-Optimal Broadcasting Protocol for Mobile Video-on-Demand. Int. J. Found. Comput. Sci. 20(1): 45-55 (2009)
2008
60EERegant Y. S. Hung, Kwok Fai Lai, Hing-Fung Ting: Finding Frequent Items in a Turnstile Data Stream. COCOON 2008: 498-509
59EERegant Y. S. Hung, Hing-Fung Ting: Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream. LATIN 2008: 699-710
58EEJoseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing-Fung Ting: Dynamic Offline Conflict-Free Coloring for Unit Disks. WAOA 2008: 241-252
57EEV. Berry, Z. S. Peng, H. F. Ting: From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time. Algorithmica 50(3): 369-385 (2008)
56EERegant Y. S. Hung, H. F. Ting: Competitive analysis of most-request-first for scheduling broadcasts with start-up delay. Theor. Comput. Sci. 396(1-3): 200-211 (2008)
55EEHing-Fung Ting: A near optimal scheduler for on-demand data broadcasts. Theor. Comput. Sci. 401(1-3): 77-84 (2008)
2007
54EERegant Y. S. Hung, Hing-Fung Ting: An Optimal Broadcasting Protocol for Mobile Video-on-Demand. CATS 2007: 79-84
53EEZeshan Peng, Hing-Fung Ting: Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge. CPM 2007: 195-204
52EEFrancis Y. L. Chin, Hing-Fung Ting, Yong Zhang: A Constant-Competitive Algorithm for Online OVSF Code Assignment. ISAAC 2007: 452-463
2006
51EEHing-Fung Ting: A Near Optimal Scheduler for On-Demand Data Broadcasts. CIAC 2006: 163-174
50EERegant Y. S. Hung, H. F. Ting: A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast. COCOON 2006: 330-339
49EERegant Y. S. Hung, Hing-Fung Ting: Design and Analysis of Online Batching Systems. LATIN 2006: 605-616
48EELap-Kei Lee, H. F. Ting: A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. PODS 2006: 290-297
47EELap-Kei Lee, H. F. Ting: Maintaining significant stream statistics over sliding windows. SODA 2006: 724-732
46EEZ. S. Peng, H. F. Ting: An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees. Inf. Process. Lett. 100(4): 137-144 (2006)
45EEHo-Fung Leung, Zeshan Peng, Hing-Fung Ting: An efficient algorithm for online square detection. Theor. Comput. Sci. 363(1): 69-75 (2006)
2005
44EESiu-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
43EEZ. S. Peng, H. F. Ting: An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree. WABI 2005: 104-115
42EEWun-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
41EEZ. S. Peng, H. F. Ting: Time and Space Efficient Algorithms for Constrained Sequence Alignment. CIAA 2004: 237-246
40EEWun-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
39EEHo-fung Leung, Zeshan Peng, Hing-Fung Ting: An Efficient Online Algorithm for Square Detection. COCOON 2004: 432-439
38EEZeshan Peng, Hing-Fung Ting: An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees. ISAAC 2004: 754-765
37EEPrudence 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)
2003
36EEWun-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
35EETak 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
34EEWun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting: Escaping a Grid by Edge-Disjoint Paths. Algorithmica 36(4): 343-359 (2003)
33EEWun-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
32EEWun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong: Competitive Analysis of On-line Stream Merging Algorithms. MFCS 2002: 188-200
31EEWun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong: A unified analysis of hot video schedulers. STOC 2002: 179-188
30EETak 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
29EEWun-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
28 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
27EEMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting: Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees CoRR cs.CE/0101031: (2001)
26EEMing-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)
25 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)
24 H. Y. Lau, H. F. Ting: The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent. J. Comb. Optim. 5(4): 411-420 (2001)
23EEMing-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
22EEMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting: A Faster and Unifying Algorithm for Comparing Trees. CPM 2000: 129-142
21EEMing-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
20EEWun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting: Escaping a grid by edge-disjoint paths. SODA 2000: 726-734
19EEMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting: A Decomposition Theorem for Maximum Weight Bipartite Matchings CoRR cs.DS/0011015: (2000)
18 Tak Wah Lam, Hing-Fung Ting: Selecting the k largest elements with parity tests. Discrete Applied Mathematics 101(1-3): 187-196 (2000)
17 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
16EEDavid 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
15EEH. Y. Lau, H. F. Ting: The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set. COCOON 1999: 483-492
14EEMing-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
13EEWun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting: A Faster Algorithm for Finding Disjoint Paths in Grids. ISAAC 1999: 393-402
1998
12 Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting: Default-Sensitive PreProcessings for Finding Maxima. CATS 1998: 107-120
11EETak Wah Lam, Hing-Fung Ting: Selecting the k Largest Elements with Parity Tests. ISAAC 1998: 189-198
1997
10EEMing-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting: All-Cavity Maximum Matchings. ISAAC 1997: 364-373
9EEMing-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
8EEHo-fung Leung, Hing-Fung Ting: An Optimal Algorithm for Global Termination Detection in Shared-Memory Asynchronous Multiprocessor Systems. IEEE Trans. Parallel Distrib. Syst. 8(5): 538-543 (1997)
1996
7EETak Wah Lam, Wing-Kin Sung, Hing-Fung Ting: Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. SWAT 1996: 124-135
6 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)
1994
5 Hing-Fung Ting, Andrew Chi-Chih Yao: A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests. Inf. Process. Lett. 49(1): 39-43 (1994)
1990
4 Francis Y. L. Chin, H. F. Ting: Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees. SIAM J. Comput. 19(4): 612-626 (1990)
1987
3 Francis Y. L. Chin, H. F. Ting: An Improved Algorithm for Finding the Median Distributively. Algorithmica 2: 235-249 (1987)
1985
2 Francis Y. L. Chin, H. F. Ting: An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees FOCS 1985: 257-266
1 Francis Y. L. Chin, H. F. Ting: A Near-optimal Algorithm for Finding the Median Distributively. ICDCS 1985: 459-465

Coauthor Index

1V. Berry [57]
2P. Y. Chan [44]
3Wun-Tat Chan (Joseph Wun-Tat Chan) [13] [20] [28] [29] [31] [32] [33] [34] [36] [40] [42] [58] [64]
4David Wai-Lok Cheung (David W. Cheung) [16]
5Francis Y. L. Chin (Francis Yuk-Lun Chin) [1] [2] [3] [4] [13] [20] [34] [52] [58] [62] [64] [65]
6Xin Han [62]
7Xiangyu Hong [58]
8Regant Y. S. Hung [49] [50] [54] [56] [59] [60] [61]
9Ben Kao (Benjamin C. M. Kao) [16]
10Ming-Yang Kao [9] [10] [12] [14] [17] [19] [21] [22] [23] [25] [26] [27]
11Kwok Fai Lai [60]
12Tak Wah Lam [6] [7] [9] [10] [11] [12] [14] [16] [17] [18] [19] [21] [22] [23] [25] [26] [27] [28] [29] [30] [31] [32] [33] [35] [36] [37] [40] [42] [44] [63]
13H. Y. Lau [15] [24]
14Lap-Kei Lee [47] [48] [63]
15Ho-fung Leung (Ho-Fung Leung) [8] [39] [45]
16Hongjun Lu [16]
17N. Lu [35] [37]
18Z. S. Peng [41] [43] [46] [57]
19Zeshan Peng [38] [39] [45] [53]
20Teresa M. Przytycka [9]
21Wing-Kin Sung (Ken Wing-Kin Sung) [6] [7] [9] [10] [12] [14] [17] [19] [21] [22] [23] [25] [26] [27] [44]
22Isaac Kar-Keung To (Kar-Keung To) [30] [63]
23Prudence W. H. Wong [28] [29] [30] [31] [32] [33] [35] [36] [37] [40] [42] [44] [63]
24Andrew Chi-Chih Yao [5]
25Siu-Ming Yiu [35] [37] [44]
26Guochuan Zhang [62]
27Yong Zhang [52] [64] [65]
28Bo Zhou [16]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)