The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

H. F. Ting: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Regant Y. S. Hung, H. F. Ting
    A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:330-339 [Conf]
  2. H. Y. Lau, H. F. Ting
    The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:483-492 [Conf]
  3. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:257-266 [Conf]
  4. Francis Y. L. Chin, H. F. Ting
    A Near-optimal Algorithm for Finding the Median Distributively. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1985, pp:459-465 [Conf]
  5. L. K. Lee, H. F. Ting
    A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:290-297 [Conf]
  6. L. K. Lee, H. F. Ting
    Maintaining significant stream statistics over sliding windows. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:724-732 [Conf]
  7. Z. S. Peng, H. F. Ting
    An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:104-115 [Conf]
  8. Z. S. Peng, H. F. Ting
    Time and Space Efficient Algorithms for Constrained Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:237-246 [Conf]
  9. Francis Y. L. Chin, H. F. Ting
    An Improved Algorithm for Finding the Median Distributively. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:235-249 [Journal]
  10. Z. S. Peng, H. F. Ting
    An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:4, pp:137-144 [Journal]
  11. H. Y. Lau, H. F. Ting
    The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2001, v:5, n:4, pp:411-420 [Journal]
  12. Francis Y. L. Chin, H. F. Ting
    Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:4, pp:612-626 [Journal]

  13. From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time. [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002