( en | de | ru )

 

Disambiguation of "Ting, Hing-Fung"

Author of the publication

copydeleteadd this publication to your clipboard
Design and Analysis of Online Batching Systems.

, and . LATIN, volume 3887 of Lecture Notes in Computer Science, page 605-616. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Siuwah Fung

Pat Fung

Reginald Fung

Michael Fung

M Tingart

 

Other publications of authors with the same name

An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees., and . Inf. Process. Lett., 100 (4): 137-144 (2006)Approximation algorithms for the partial assignment problem., , , , , and . Theor. Comput. Sci., (2020)Constant competitive algorithms for unbounded one-Way trading under monotone hazard rate., , , , and . Math. Found. Comput., 1 (4): 383-392 (2018)An efficient algorithm for optimizing whole genome alignment with noise., , , , and . Bioinform., 20 (16): 2676-2684 (2004)On-line Stream Merging with Max Span and Min Coverage., , , and . Theory Comput. Syst., 38 (4): 461-479 (2005)Requirement-Based Data Cube Schema Design., , , , , and . CIKM, page 162-169. ACM, (1999)A Faster and Unifying Algorithm for Comparing Trees., , , and . CPM, volume 1848 of Lecture Notes in Computer Science, page 129-142. Springer, (2000)Selecting the k Largest Elements with Parity Tests., and . ISAAC, volume 1533 of Lecture Notes in Computer Science, page 189-198. Springer, (1998)An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees., and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 754-765. Springer, (2004)Design and Analysis of Online Batching Systems., and . LATIN, volume 3887 of Lecture Notes in Computer Science, page 605-616. Springer, (2006)