default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHing-Fung Ting
H. F. Ting
Person information
- affiliation: University of Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j61]Xinxin Han, Guichen Gao, Yang Wang, Hing-Fung Ting, Ilsun You, Yong Zhang:
Online data caching in edge computing. Concurr. Comput. Pract. Exp. 35(17) (2023)- [j60]Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin
, Yong Zhang:
A linear-time certifying algorithm for recognizing generalized series-parallel graphs. Discret. Appl. Math. 325: 152-171 (2023) - [j59]Yanan Gong, Kam-Pui Chow, Siu Ming Yiu, Hing-Fung Ting:
Analyzing the peeling chain patterns on the Bitcoin blockchain. Forensic Sci. Int. Digit. Investig. 46(Supplement): 301614 (2023) - [j58]Mengmeng Kuang, Yong Zhang, Tak Wah Lam, Hing-Fung Ting:
MLProbs: A Data-Centric Pipeline for Better Multiple Sequence Alignment. IEEE ACM Trans. Comput. Biol. Bioinform. 20(1): 524-533 (2023) - 2022
- [j57]Yanan Gong, Kam-Pui Chow, Siu-Ming Yiu, Hing-Fung Ting:
Sensitivity analysis for a Bitcoin simulation model. Digit. Investig. 43(Supplement): 301449 (2022) - [j56]Guichen Gao, Xinxin Han, Li Ning, Hing-Fung Ting, Yong Zhang:
Principal-agent problem under the linear contract. J. Comb. Optim. 44(4): 2286-2301 (2022) - [c84]Yanan Gong, Kam-Pui Chow, Hing-Fung Ting, Siu-Ming Yiu:
Analyzing the Error Rates of Bitcoin Clustering Heuristics. IFIP Int. Conf. Digital Forensics 2022: 187-205 - 2021
- [c83]Ye Wu, Hing-Fung Ting, Tak Wah Lam, Ruibang Luo:
BioNumQA-BERT: answering biomedical questions using numerical facts with a deep language representation model. BCB 2021: 57:1-57:6 - 2020
- [j55]Pan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting, Yong Zhang:
Approximation algorithms for the selling with preference. J. Comb. Optim. 40(2): 366-378 (2020) - [j54]Yong Zhang, Francis Y. L. Chin, Sheung-Hung Poon, Hing-Fung Ting, Dachuan Xu, Dongxiao Yu:
Offline and online algorithms for single-minded selling problem. Theor. Comput. Sci. 821: 15-22 (2020) - [j53]Guichen Gao, Li Ning, Hing-Fung Ting, Yicheng Xu, Yong Zhang, Yifei Zou:
Approximation algorithms for the partial assignment problem. Theor. Comput. Sci. 838: 231-237 (2020) - [c82]Guichen Gao, Xinxin Han, Li Ning, Hing-Fung Ting, Yong Zhang:
Robustness and Approximation for the Linear Contract Design. AAIM 2020: 273-285 - [c81]Ye Wu, Ruibang Luo, Tak Wah Lam, Hing-Fung Ting, Junwen Wang:
Translocator: local realignment and global remapping enabling accurate translocation detection using single-molecule sequencing long reads. BCB 2020: 15:1-15:7 - [c80]Mengmeng Kuang, Hing-Fung Ting:
A data-centric pipeline using convolutional neural network to select better multiple sequence alignment method. BCB 2020: 72:1 - [c79]Huiling Zhang, Hao Wu, Hing-Fung Ting, Yanjie Wei:
Protein Interresidue Contact Prediction Based on Deep Learning and Massive Features from Multi-sequence Alignment. PDCAT 2020: 219-228 - [c78]Xinxin Han, Guichen Gao, Yang Wang, Hing-Fung Ting, Yong Zhang:
Data Caching Based Transfer Optimization in Large Scale Networks. PDCAT 2020: 330-340
2010 – 2019
- 2019
- [c77]Guichen Gao, Li Ning, Hing-Fung Ting, Yong Zhang, Yifei Zou:
Algorithmic Pricing for the Partial Assignment. COCOA 2019: 210-222 - [c76]Pan Li, Qiang Hua, Zhijun Hu, Hing-Fung Ting, Yong Zhang:
Approximation Algorithm and Incentive Ratio of the Selling with Preference. COCOA 2019: 328-339 - [c75]Ye Wu, Ruibang Luo, Henry C. M. Leung, Hing-Fung Ting, Tak Wah Lam:
RENET: A Deep Learning Approach for Extracting Gene-Disease Associations from Literature. RECOMB 2019: 272-284 - 2018
- [j52]Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Sharma V. Thankachan, Hing-Fung Ting, Yilin Yang:
Dictionary Matching with a Bounded Gap in Pattern or in Text. Algorithmica 80(2): 698-713 (2018) - [j51]Huijun Mai, Yifan Zhang, Dinghua Li, Henry Chi-Ming Leung, Ruibang Luo, Chi-Kwong Wong, Hing-Fung Ting, Tak Wah Lam:
AC-DIAMOND v1: accelerating large-scale DNA-protein alignment. Bioinform. 34(21): 3744-3746 (2018) - [j50]Yong Zhang, Francis Y. L. Chin, Francis C. M. Lau, Haisheng Tan, Hing-Fung Ting:
Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate. Math. Found. Comput. 1(4): 383-392 (2018) - [c74]Francis Y. L. Chin, Sheung-Hung Poon, Hing-Fung Ting, Dachuan Xu, Dongxiao Yu, Yong Zhang:
Approximation and Competitive Algorithms for Single-Minded Selling Problem. AAIM 2018: 98-110 - [c73]Dinghua Li, Henry Chi-Ming Leung, Chi-Kwong Wong, Yifan Zhang, Wai-Chun Law, Yan Xin, Ruibang Luo, Hing-Fung Ting, Tak Wah Lam:
MegaPath: Low-Similarity Pathogen Detection from Metagenomic NGS Data (Extended Abstract). ICCABS 2018: 1 - 2017
- [j49]Dinghua Li, Yukun Huang, Henry C. M. Leung, Ruibang Luo, Hing-Fung Ting, Tak Wah Lam:
MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs. BMC Bioinform. 18(S-12): 67-75 (2017) - [j48]Haobin Yao, Tak Wah Lam, H. F. Ting, Siu-Ming Yiu, Yadong Wang, Bo Liu:
Accurate annotation of metagenomic data without species-level references. Int. J. Data Min. Bioinform. 19(4): 283-297 (2017) - [j47]Minghui Zhang, Xin Han, Yan Lan, Hing-Fung Ting:
Online bin packing problem with buffer and bounded size revisited. J. Comb. Optim. 33(2): 530-542 (2017) - [c72]Francis Y. L. Chin, Francis C. M. Lau, Haisheng Tan, Hing-Fung Ting, Yong Zhang:
Unbounded One-Way Trading on Distributions with Monotone Hazard Rate. COCOA (1) 2017: 439-449 - 2016
- [j46]Yongtao Ye, Tak Wah Lam, Hing-Fung Ting:
PnpProbs: a better multiple sequence alignment tool by better handling of guide trees. BMC Bioinform. 17(S-8): 285 (2016) - [j45]Yong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang, Jianyu Shi:
Constrained pairwise and center-star sequences alignment problems. J. Comb. Optim. 32(1): 79-94 (2016) - [c71]Haobin Yao, Tak Wah Lam, Hing-Fung Ting, Siu-Ming Yiu, Yadong Wang, Bo Liu:
Accurate annotation of metagenomic data without species-level references. BIBM 2016: 59-64 - [c70]Huijun Mai, Dinghua Li, Yifan Zhang, Henry Chi-Ming Leung, Ruibang Luo, Hing-Fung Ting, Tak Wah Lam:
AC-DIAMOND: Accelerating Protein Alignment via Better SIMD Parallelization and Space-Efficient Indexing. IWBBIO 2016: 426-433 - 2015
- [j44]Qing Zhan, Yongtao Ye, Tak Wah Lam, Siu-Ming Yiu, Yadong Wang, Hing-Fung Ting:
Improving multiple sequence alignment by using better guide trees. BMC Bioinform. 16(S-5): S4 (2015) - [j43]Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting:
Online bin packing with (1, 1) and (2, R) bins. J. Comb. Optim. 30(2): 276-298 (2015) - [j42]Yongtao Ye, David Wai-Lok Cheung, Yadong Wang, Siu-Ming Yiu, Qing Zhan, Tak Wah Lam, Hing-Fung Ting:
GLProbs: Aligning Multiple Sequences Adaptively. IEEE ACM Trans. Comput. Biol. Bioinform. 12(1): 67-78 (2015) - [j41]Hing-Fung Ting, Xiangzhong Xiang:
Online pricing for multi-type of items. Theor. Comput. Sci. 572: 66-82 (2015) - [j40]Francis Y. L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, Diwei Zhou:
Competitive algorithms for unbounded one-way trading. Theor. Comput. Sci. 607: 35-48 (2015) - [j39]Hing-Fung Ting, Xiangzhong Xiang:
Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching. Theor. Comput. Sci. 607: 247-256 (2015) - [c69]Jing Chen, Xin Han, Wolfgang W. Bein, Hing-Fung Ting:
Black and White Bin Packing Revisited. COCOA 2015: 45-59 - [c68]Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Sharma V. Thankachan, Hing-Fung Ting, Yilin Yang:
Dictionary Matching with Uneven Gaps. CPM 2015: 247-260 - [c67]Huijun Mai, Tak Wah Lam, Hing-Fung Ting:
A simple and economical method for improving whole-genome alignment. ICCABS 2015: 1 - [c66]Menglu Li, Micheal Cheng, Yongtao Ye, Wing-Kai Hon, Hing-Fung Ting, Tak Wah Lam, Cy Tang, Thomas Wong, Siu-Ming Yiu:
Predicting RNA Secondary Structures: One-grammar-fits-all Solution. ISBRA 2015: 211-222 - 2014
- [j38]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Online pricing for bundles of multiple items. J. Glob. Optim. 58(2): 377-387 (2014) - [j37]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Constant-competitive tree node assignment. Theor. Comput. Sci. 518: 10-21 (2014) - [j36]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon, Yung H. Tsin, Deshi Ye:
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing. Theor. Comput. Sci. 554: 135-149 (2014) - [c65]Francis Y. L. Chin, Bin Fu, Minghui Jiang, Hing-Fung Ting, Yong Zhang:
Competitive Algorithms for Unbounded One-Way Trading. AAIM 2014: 32-43 - [c64]Hing-Fung Ting, Xiangzhong Xiang:
Near Optimal Algorithms for Online Maximum Weighted b-Matching. FAW 2014: 240-251 - [c63]Yong Zhang, Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Deshi Ye, Feng Zhang, Jianyu Shi:
On the Complexity of Constrained Sequences Alignment Problems. FAW 2014: 309-319 - 2013
- [j35]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han:
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing. J. Comb. Optim. 26(2): 223-236 (2013) - [j34]Ruixin Ma, György Dósa, Xin Han, Hing-Fung Ting, Deshi Ye, Yong Zhang:
A note on a selfish bin packing problem. J. Glob. Optim. 56(4): 1457-1462 (2013) - [c62]Yongtao Ye, David W. Cheung, Yadong Wang, Siu-Ming Yiu, Qing Zhan, Tak Wah Lam, Hing-Fung Ting:
GLProbs: Aligning multiple sequences adaptively. BCB 2013: 152 - [c61]Jing Chen, Xin Han, Kazuo Iwama, Hing-Fung Ting:
Online Bin Packing with (1, 1) and (2, R) Bins. COCOA 2013: 387-401 - [c60]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon, Yung H. Tsin, Deshi Ye:
Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing. COCOON 2013: 506-517 - [c59]Xuan Liu, David Wai-Lok Cheung, Hing-Fung Ting, Tak Wah Lam, Siu-Ming Yiu:
LCR_Finder: A de Novo Low Copy Repeat Finder for Human Genome. ISBRA 2013: 125-136 - 2012
- [j33]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window. Algorithmica 62(3-4): 1088-1111 (2012) - [j32]Yong Zhang, Yuxin Wang, Francis Y. L. Chin, Hing-Fung Ting:
Competitive Algorithms for Online Pricing. Discret. Math. Algorithms Appl. 4(2) (2012) - [j31]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Joseph Wun-Tat Chan, Xin Han, Ka-Cheong Lam:
Online call control in cellular networks revisited. Inf. Process. Lett. 112(1-2): 21-25 (2012) - [c58]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Online Pricing for Multi-type of Items. FAW-AAIM 2012: 82-92 - [c57]Ruibang Luo, Chang Yu, Chi-Man Liu, Tak Wah Lam, Thomas K. F. Wong, Siu-Ming Yiu, Ruiqiang Li, Hing-Fung Ting:
Efficient SNP-sensitive alignment and database-assisted SNP calling for low coverage samples. BCB 2012: 163-169 - [c56]H. F. Ting, Xiangzhong Xiang:
Equilibria of GSP for Range Auction. COCOON 2012: 580-591 - [c55]H. F. Ting, Xiangzhong Xiang:
Multi-unit Auctions with Budgets and Non-uniform Valuations. ISAAC 2012: 669-678 - 2011
- [j30]Hing-Fung Ting, Lap-Kei Lee, Ho-Leung Chan, Tak Wah Lam:
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. Algorithms 4(3): 200-222 (2011) - [j29]Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Pan Zhang:
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors. Chic. J. Theor. Comput. Sci. 2011 (2011) - [j28]Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin:
Uniformly inserting points on square grid. Inf. Process. Lett. 111(16): 773-779 (2011) - [j27]Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
Online tree node assignment with resource augmentation. J. Comb. Optim. 22(3): 359-377 (2011) - [j26]Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang, Yong Zhang:
A new upper bound 2.5545 on 2D Online Bin Packing. ACM Trans. Algorithms 7(4): 50:1-50:18 (2011) - [c54]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Zhuo Chang:
Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing. FAW-AAIM 2011: 308-318 - [c53]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Competitive Algorithms for Online Pricing. COCOON 2011: 391-401 - [c52]Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Chi-Man Liu, Hing-Fung Ting:
Sleep Management on Multiple Machines for Energy and Flow Time. ICALP (1) 2011: 219-231 - [c51]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Jiangwei Pan, Hing-Fung Ting, Qin Zhang:
Edit Distance to Monotonicity in Sliding Windows. ISAAC 2011: 564-573 - [i7]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Jiangwei Pan, Hing-Fung Ting, Qin Zhang:
Edit Distance to Monotonicity in Sliding Windows. CoRR abs/1111.5386 (2011) - 2010
- [j25]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
A Constant-Competitive Algorithm for Online OVSF Code Assignment. Algorithmica 56(1): 89-104 (2010) - [j24]Regant Y. S. Hung, Hing-Fung Ting:
Design and Analysis of Online Batching Systems. Algorithmica 57(2): 217-231 (2010) - [j23]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
One-Space Bounded Algorithms for Two-Dimensional Bin Packing. Int. J. Found. Comput. Sci. 21(6): 875-891 (2010) - [j22]Regant Y. S. Hung, Lap-Kei Lee, Hing-Fung Ting:
Finding frequent items over sliding windows with constant update time. Inf. Process. Lett. 110(7): 257-260 (2010) - [c50]Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin:
Online Uniformly Inserting Points on Grid. AAIM 2010: 281-292 - [c49]Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Peng Zhang:
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors. CATS 2010: 3-10 - [c48]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs. COCOON 2010: 100-109 - [c47]Regant Y. S. Hung, Hing-Fung Ting:
An W(\frac1e log\frac1e)\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon}) Space Lower Bound for Finding epsilon-Approximate Quantiles in a Data Stream. FAW 2010: 89-100 - [c46]Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting, Yong Zhang:
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. FAW 2010: 222-233 - [c45]Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin Han, Hing-Fung Ting, Yung H. Tsin:
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing. ISAAC (2) 2010: 242-253 - [c44]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window. STACS 2010: 179-190 - [c43]Tak Wah Lam, Chi-Man Liu, Hing-Fung Ting:
Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Data. WAOA 2010: 178-189 - [i6]Joseph Wun-Tat Chan, Francis Y. L. Chin, Xin Han, Ka-Cheong Lam, Hing-Fung Ting, Yong Zhang:
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. CoRR abs/1009.2322 (2010)
2000 – 2009
- 2009
- [j21]Regant 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) - [c42]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
Variable-Size Rectangle Covering. COCOA 2009: 145-154 - [c41]Joseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
Online Tree Node Assignment with Resource Augmentation. COCOON 2009: 358-367 - [c40]Tak 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 - [c39]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
1-Bounded Space Algorithms for 2-Dimensional Bin Packing. ISAAC 2009: 321-330 - [c38]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. WAOA 2009: 49-61 - [i5]Xin Han, Francis Y. L. Chin, Hing-Fung Ting, Guochuan Zhang:
A New Upper Bound on 2D Online Bin Packing. CoRR abs/0906.0409 (2009) - [i4]Ho-Leung Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting:
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window. CoRR abs/0912.4569 (2009) - 2008
- [j20]Vincent Berry, Zeshan Peng, H. F. Ting:
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time. Algorithmica 50(3): 369-385 (2008) - [j19]Regant 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) - [j18]Hing-Fung Ting:
A near optimal scheduler for on-demand data broadcasts. Theor. Comput. Sci. 401(1-3): 77-84 (2008) - [c37]Regant Y. S. Hung, Kwok Fai Lai, Hing-Fung Ting:
Finding Frequent Items in a Turnstile Data Stream. COCOON 2008: 498-509 - [c36]Regant Y. S. Hung, Hing-Fung Ting:
Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream. LATIN 2008: 699-710 - [c35]Joseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing-Fung Ting:
Dynamic Offline Conflict-Free Coloring for Unit Disks. WAOA 2008: 241-252 - 2007
- [c34]Regant Y. S. Hung, Hing-Fung Ting:
An Optimal Broadcasting Protocol for Mobile Video-on-Demand. CATS 2007: 79-84 - [c33]Zeshan Peng, Hing-Fung Ting:
Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge. CPM 2007: 195-204 - [c32]Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang:
A Constant-Competitive Algorithm for Online OVSF Code Assignment. ISAAC 2007: 452-463 - 2006
- [j17]Zeshan Peng, Hing-Fung Ting:
An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees. Inf. Process. Lett. 100(4): 137-144 (2006) - [j16]Ho-fung Leung, Zeshan Peng, Hing-Fung Ting:
An efficient algorithm for online square detection. Theor. Comput. Sci. 363(1): 69-75 (2006) - [c31]Hing-Fung Ting:
A Near Optimal Scheduler for On-Demand Data Broadcasts. CIAC 2006: 163-174 - [c30]Regant Y. S. Hung, H. F. Ting:
A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast. COCOON 2006: 330-339 - [c29]Regant Y. S. Hung, Hing-Fung Ting:
Design and Analysis of Online Batching Systems. LATIN 2006: 605-616 - [c28]Lap-Kei Lee, H. F. Ting:
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. PODS 2006: 290-297 - [c27]Lap-Kei Lee, H. F. Ting:
Maintaining significant stream statistics over sliding windows. SODA 2006: 724-732 - 2005
- [j15]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) - [c26]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 - [c25]Zeshan Peng, H. F. Ting:
An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree. WABI 2005: 104-115 - 2004
- [j14]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. Bioinform. 20(16): 2676-2684 (2004) - [c24]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 - [c23]Ho-fung Leung, Zeshan Peng, Hing-Fung Ting:
An Efficient Online Algorithm for Square Detection. COCOON 2004: 432-439 - [c22]Zeshan 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 - [c21]Zeshan Peng, H. F. Ting:
Time and Space Efficient Algorithms for Constrained Sequence Alignment. CIAA 2004: 237-246 - 2003
- [j13]Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
Escaping a Grid by Edge-Disjoint Paths. Algorithmica 36(4): 343-359 (2003) - [j12]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) - [c20]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 - [c19]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 - 2002
- [j11]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) - [c18]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 - [c17]Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
A unified analysis of hot video schedulers. STOC 2002: 179-188 - 2001
- [j10]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) - [j9]Hing-Yip Lau, H. F. Ting:
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent. J. Comb. Optim. 5(4): 411-420 (2001) - [j8]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) - [c16]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 - [c15]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 - [i3]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) - [i2]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) - 2000
- [j7]Tak Wah Lam, Hing-Fung Ting:
Selecting the k largest elements with parity tests. Discret. Appl. Math. 101(1-3): 187-196 (2000) - [j6]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) - [c14]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
A Faster and Unifying Algorithm for Comparing Trees. CPM 2000: 129-142 - [c13]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 - [c12]Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
Escaping a grid by edge-disjoint paths. SODA 2000: 726-734 - [i1]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)
1990 – 1999
- 1999
- [c11]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 - [c10]Hing-Yip Lau, H. F. Ting:
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set. COCOON 1999: 483-492 - [c9]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 - [c8]Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting:
A Faster Algorithm for Finding Disjoint Paths in Grids. ISAAC 1999: 393-402 - 1998
- [c7]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Default-Sensitive PreProcessings for Finding Maxima. CATS 1998: 107-120 - [c6]Tak Wah Lam, Hing-Fung Ting:
Selecting the k Largest Elements with Parity Tests. ISAAC 1998: 189-198 - 1997
- [j5]Ho-fung Leung, Hing-Fung Ting:
An Optimal Algorithm for Global Termination Detection in Shared-Memory Asynchronous Multiprocessor Systems. IEEE Trans. Parallel Distributed Syst. 8(5): 538-543 (1997) - [c5]Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
All-Cavity Maximum Matchings. ISAAC 1997: 364-373 - [c4]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 - 1996
- [j4]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) - [c3]Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. SWAT 1996: 124-135 - 1994
- [j3]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
- [j2]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)
1980 – 1989
- 1987
- [j1]Francis Y. L. Chin, H. F. Ting:
An Improved Algorithm for Finding the Median Distributively. Algorithmica 2: 235-249 (1987) - 1985
- [c2]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 - [c1]Francis Y. L. Chin, H. F. Ting:
A Near-optimal Algorithm for Finding the Median Distributively. ICDCS 1985: 459-465
Coauthor Index
Wun-Tat Chan
aka: Joseph Wun-Tat Chan
aka: Joseph Wun-Tat Chan
[j58] [c83] [c81] [c75] [j52] [j51] [c73] [j49] [j48] [j46] [c71] [c70] [j44] [j42] [c68] [c67] [c66] [c62] [c59] [j33] [c57] [j30] [j29] [c52] [c51] [i7] [c49] [c44] [c43] [c40] [c38] [i4] [j15] [c26] [j14] [c24] [j12] [c20] [c19] [j11] [c18] [c17] [j10] [j8] [c16] [c15] [i3] [i2] [j7] [j6] [c14] [c13] [i1] [c11] [c9] [c7] [c6] [c5] [c4] [j4] [c3]
Siu-Ming Yiu
aka: Siu Ming Yiu
aka: Siu Ming Yiu
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 20:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
