The SCEAS System
| |||||||

## Search the dblp DataBase
Hing-Fung Ting:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - Hing-Fung Ting
**A Near Optimal Scheduler for On-Demand Data Broadcasts.**[Citation Graph (0, 0)][DBLP] CIAC, 2006, pp:163-174 [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] - 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] - Ho-fung Leung, Zeshan Peng, Hing-Fung Ting
**An Efficient Online Algorithm for Square Detection.**[Citation Graph (0, 0)][DBLP] COCOON, 2004, pp:432-439 [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] - 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, 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] - Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
**A Faster Algorithm for Finding Disjoint Paths in Grids.**[Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:393-402 [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, 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, Hing-Fung Ting
**Selecting the k Largest Elements with Parity Tests.**[Citation Graph (0, 0)][DBLP] ISAAC, 1998, pp:189-198 [Conf] - Zeshan Peng, Hing-Fung Ting
**An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees.**[Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:754-765 [Conf] - Regant Y. S. Hung, Hing-Fung Ting
**Design and Analysis of Online Batching Systems.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:605-616 [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] - Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
**Escaping a grid by edge-disjoint paths.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:726-734 [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, 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] - Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting
**Escaping a Grid by Edge-Disjoint Paths.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:36, n:4, pp:343-359 [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] - 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] - 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] - 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] - Hing-Fung Ting, Andrew Chi-Chih Yao
**A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:1, pp:39-43 [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] - 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] - 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] - 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, 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] - 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] - Ho-fung Leung, Zeshan Peng, Hing-Fung Ting
**An efficient algorithm for online square detection.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:363, n:1, pp:69-75 [Journal] - Ho-fung Leung, Hing-Fung Ting
**An Optimal Algorithm for Global Termination Detection in Shared-Memory Asynchronous Multiprocessor Systems.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:5, pp:538-543 [Journal] - Zeshan Peng, Hing-Fung Ting
**Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge.**[Citation Graph (0, 0)][DBLP] CPM, 2007, pp:195-204 [Conf] **Online Uniformly Inserting Points on Grid.**[Citation Graph (, )][DBLP]**An Optimal Broadcasting Protocol for Mobile Video-on-Demand.**[Citation Graph (, )][DBLP]**Default-Sensitive PreProcessings for Finding Maxima.**[Citation Graph (, )][DBLP]**Finding Frequent Items in a Turnstile Data Stream.**[Citation Graph (, )][DBLP]**Online Tree Node Assignment with Resource Augmentation.**[Citation Graph (, )][DBLP]**Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs.**[Citation Graph (, )][DBLP]**Sleep with Guilt and Work Faster to Minimize Flow Plus Energy.**[Citation Graph (, )][DBLP]**A Constant-Competitive Algorithm for Online OVSF Code Assignment.**[Citation Graph (, )][DBLP]**1-Bounded Space Algorithms for 2-Dimensional Bin Packing.**[Citation Graph (, )][DBLP]**Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream.**[Citation Graph (, )][DBLP]**Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window.**[Citation Graph (, )][DBLP]**Dynamic Offline Conflict-Free Coloring for Unit Disks.**[Citation Graph (, )][DBLP]**Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window.**[Citation Graph (, )][DBLP]**Variable-Size Rectangle Covering.**[Citation Graph (, )][DBLP]**An W(\frac1e log\frac1e)\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon}) Space Lower Bound for Finding**[Citation Graph (, )][DBLP]*epsilon*-Approximate Quantiles in a Data Stream.**Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks.**[Citation Graph (, )][DBLP]**A Constant-Competitive Algorithm for Online OVSF Code Assignment.**[Citation Graph (, )][DBLP]**Design and Analysis of Online Batching Systems.**[Citation Graph (, )][DBLP]**A New Upper Bound on 2D Online Bin Packing**[Citation Graph (, )][DBLP]**Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window**[Citation Graph (, )][DBLP]
Search in 0.041secs, Finished in 0.043secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |