Name Card
Dr Ting, Hing Fung 田慶豐
Title:
Honorary Associate Professor
Department:
Faculty:
Publications - Conference Papers
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
General techniques for comparing unrooted evolutionary trees Proceeding/Conference:Conference Proceedings of the Annual ACM Symposium on Theory of Computing | 1997 | 109 | ||
Finding heavy hitters over the sliding window of a weighted data stream Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2008 | 115 | ||
Finding frequent items in a turnstile data stream Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2008 | 111 | ||
A Faster and Unifying algorithm for Comparing Trees Proceeding/Conference:Proceedings of the 11th Annual Symposium on Combinatiorial Pattern Matching | 2000 | 96 | ||
A Faster Algorithm for Finding Disjoint Pattrs in Grids Proceeding/Conference:Proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC'99 | 1999 | 79 | ||
Escaping a grid by edge-disjoint paths Proceeding/Conference:Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2000 | 115 | ||
Equilibria of GSP for range auction Proceeding/Conference:Lecture Notes in Computer Science | 2012 | 35 | ||
Efficient SNP-sensitive alignment and database-assisted SNP calling for low coverage samples Proceeding/Conference:Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine (BCB '12) | 2012 | 90 | ||
An efficient reduction from constrained to unconstrained maximum agreement subtree Proceeding/Conference:Lecture Notes in Computer Science | 2005 | 100 | ||
An efficient online algorithm for square detection Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004 | 107 | ||
An efficient algorithm for optimal linear broadcast routing with capacity constraints Proceeding/Conference:Fifth Italian Conference On Theoretical Computer Science, Universita of Salerno, Italy. | 1995 | 85 | ||
Edit distance to monotonicity in sliding windows Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2011 | 125 | ||
Dynamic offline conflict-free coloring for unit disks Proceeding/Conference:Lecture Notes in Computer Science | 2009 | 148 | ||
Dictionary matching with uneven gaps Proceeding/Conference:Lecture Notes in Computer Science | 2015 | 68 | ||
Deterministic online call control in cellular networks and triangle-free cellular networks Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2010 | 105 | ||
Design and analysis of online batching systems Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2006 | 174 | ||
Default-sensitive preprocessings for finding maxima Proceeding/Conference:Computing Theory '98: Proceedings of the 4th Australasian Theory Symposium - CATS'98 Perth, 2-3 February 1998 | 1999 | 84 | ||
A Decomposition Theorem For Maximum Weight Bipartite Matchings with Applications To Evolutionary Trees Proceeding/Conference:Proceedings of the European Symposium on Algorithms | 1999 | 111 | ||
Continuous monitoring of distributed data streams over a time-based sliding window Proceeding/Conference:Proceedings of the International Symposium on Theoretical Aspects of Computer Science, STACS 2010 | 2010 | 119 | ||
A constant-competitive algorithm for online OVSF code assignment Proceeding/Conference:Lecture Notes in Computer Science | 2007 | 93 |
Are You Missing Publications, Invited Lectures? Click Me.