Author of the publication

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.

 

Other publications of authors with the same name

Online data caching in edge computing., , , , , and . Concurr. Comput. Pract. Exp., (2023)Offline and online algorithms for single-minded selling problem., , , , , and . Theor. Comput. Sci., (2020)Approximation algorithms for the partial assignment problem., , , , , and . Theor. Comput. Sci., (2020)Requirement-Based Data Cube Schema Design., , , , , and . CIKM, page 162-169. ACM, (1999)On-line Stream Merging with Max Span and Min Coverage., , , and . Theory Comput. Syst., 38 (4): 461-479 (2005)An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees., and . Inf. Process. Lett., 100 (4): 137-144 (2006)Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge., and . CPM, volume 4580 of Lecture Notes in Computer Science, page 195-204. Springer, (2007)A Faster and Unifying Algorithm for Comparing Trees., , , and . CPM, volume 1848 of Lecture Notes in Computer Science, page 129-142. Springer, (2000)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)Selecting the k Largest Elements with Parity Tests., and . ISAAC, volume 1533 of Lecture Notes in Computer Science, page 189-198. Springer, (1998)