Hing-Fung Ting
Orcid: 0000-0002-2807-2351Affiliations:
- University of Hong Kong
According to our database1,
Hing-Fung Ting
authored at least 132 papers
between 1985 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on cs.hku.hk
On csauthors.net:
Bibliography
2023
Forensic Sci. Int. Digit. Investig., October, 2023
IEEE ACM Trans. Comput. Biol. Bioinform., 2023
A linear-time certifying algorithm for recognizing generalized series-parallel graphs.
Discret. Appl. Math., 2023
2022
Proceedings of the Advances in Digital Forensics XVIII, 2022
2021
BioNumQA-BERT: answering biomedical questions using numerical facts with a deep language representation model.
Proceedings of the BCB '21: 12th ACM International Conference on Bioinformatics, 2021
2020
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
Protein Interresidue Contact Prediction Based on Deep Learning and Massive Features from Multi-sequence Alignment.
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020
Translocator: local realignment and global remapping enabling accurate translocation detection using single-molecule sequencing long reads.
Proceedings of the BCB '20: 11th ACM International Conference on Bioinformatics, 2020
A data-centric pipeline using convolutional neural network to select better multiple sequence alignment method.
Proceedings of the BCB '20: 11th ACM International Conference on Bioinformatics, 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
RENET: A Deep Learning Approach for Extracting Gene-Disease Associations from Literature.
Proceedings of the Research in Computational Molecular Biology, 2019
Proceedings of the Combinatorial Optimization and Applications, 2019
Proceedings of the Combinatorial Optimization and Applications, 2019
2018
Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate.
Math. Found. Comput., 2018
MegaPath: Low-Similarity Pathogen Detection from Metagenomic NGS Data (Extended Abstract).
Proceedings of the 8th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2018
Proceedings of the Algorithmic Aspects in Information and Management, 2018
2017
J. Comb. Optim., 2017
Int. J. Data Min. Bioinform., 2017
MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
BMC Bioinform., 2017
Proceedings of the Combinatorial Optimization and Applications, 2017
2016
J. Comb. Optim., 2016
PnpProbs: a better multiple sequence alignment tool by better handling of guide trees.
BMC Bioinform., 2016
AC-DIAMOND: Accelerating Protein Alignment via Better SIMD Parallelization and Space-Efficient Indexing.
Proceedings of the Bioinformatics and Biomedical Engineering, 2016
2015
Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching.
Theor. Comput. Sci., 2015
IEEE ACM Trans. Comput. Biol. Bioinform., 2015
BMC Bioinform., 2015
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015
Proceedings of the 5th IEEE International Conference on Computational Advances in Bio and Medical Sciences, 2015
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015
Proceedings of the Combinatorial Optimization and Applications, 2015
2014
Theor. Comput. Sci., 2014
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014
Proceedings of the Algorithmic Aspects in Information and Management, 2014
2013
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing.
J. Comb. Optim., 2013
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013
2012
Algorithmica, 2012
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012
Efficient SNP-sensitive alignment and database-assisted SNP calling for low coverage samples.
Proceedings of the ACM International Conference on Bioinformatics, 2012
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012
2011
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.
Chic. J. Theor. Comput. Sci., 2011
Algorithms, 2011
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011
2010
Inf. Process. Lett., 2010
Int. J. Found. Comput. Sci., 2010
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
An W(\frac1e log\frac1e)\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon}) Space Lower Bound for Finding <i>epsilon</i>-Approximate Quantiles in a Data Stream.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks.
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors.
Proceedings of the Theory of Computing 2010, 2010
Proceedings of the Algorithmic Aspects in Information and Management, 2010
2009
Int. J. Found. Comput. Sci., 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009
Proceedings of the Combinatorial Optimization and Applications, 2009
2008
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay.
Theor. Comput. Sci., 2008
Algorithmica, 2008
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
2007
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007
2006
An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees.
Inf. Process. Lett., 2006
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005
Allowing mismatches in anchors for wholw genome alignment: Generation and effectiveness.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005
2004
Bioinform., 2004
Proceedings of the Implementation and Application of Automata, 2004
An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004
New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004
2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
2001
SIAM J. Comput., 2001
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent.
J. Comb. Optim., 2001
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings.
J. Algorithms, 2001
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
SIAM J. Comput., 2000
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000
1999
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees.
Proceedings of the Algorithms, 1999
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999
Proceedings of the 1999 ACM CIKM International Conference on Information and Knowledge Management, 1999
1998
Default-Sensitive PreProcessings for Finding Maxima.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998
1997
An Optimal Algorithm for Global Termination Detection in Shared-Memory Asynchronous Multiprocessor Systems.
IEEE Trans. Parallel Distributed Syst., 1997
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
1996
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time.
Nord. J. Comput., 1996
1994
Inf. Process. Lett., 1994
1990
Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees.
SIAM J. Comput., 1990
1987
1985
A Near-optimal Algorithm for Finding the Median Distributively.
Proceedings of the 5th International Conference on Distributed Computing Systems, 1985
An Almost Linear Time and O(n log n + e) Messages Distributed Algorithm for Minimum-Weight Spanning Trees
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985