( en | de | ru )

 

Disambiguation of "Chan, T.-H. Hubert"

Author of the publication

copydeleteadd this publication to your clipboard
A PTAS for the Steiner Forest Problem in Doubling Metrics.

, , and . FOCS, page 810-819. IEEE Computer Society, (2016)

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.

Hubert H Zimmermann

Wilhelm Chan

Raquel Chan

Clifford Chan

Denise Chan

 

Other publications of authors with the same name

Online Submodular Maximization with Free Disposal., , , , and . ACM Trans. Algorithms, 14 (4): 56:1-56:29 (2018)More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting., , , , and . ASIACRYPT (3), volume 11274 of Lecture Notes in Computer Science, page 158-188. Springer, (2018)Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method., , , and . ICML, volume 70 of Proceedings of Machine Learning Research, page 4026-4034. PMLR, (2017)Finding Subgraphs with Maximum Total Density and Limited Overlap., , , , and . WSDM, page 379-388. ACM, (2015)Revisiting Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search., , and . WWW, page 173-183. ACM, (2019)Max-min greedy matching problem: Hardness for the adversary and fractional variant., , and . Theor. Comput. Sci., (February 2024)Locality-Preserving Oblivious RAM., , , , , and . J. Cryptol., 35 (2): 6 (2022)Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions., , , and . ITC, volume 199 of LIPIcs, page 8:1-8:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Foundations of Differentially Oblivious Algorithms., , , and . SODA, page 2448-2467. SIAM, (2019)Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels., , , and . SODA, page 2349-2365. SIAM, (2020)