( en | de | ru )

 

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

Author of the publication

copydeleteadd this publication to your clipboard
Locality-Preserving Oblivious RAM.

, , , , , and . J. Cryptol., 35 (2): 6 (2022)

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

Danny Chan

 

Other publications of authors with the same name

Private and Continual Release of Statistics., , and . ICALP (2), volume 6199 of Lecture Notes in Computer Science, page 405-417. Springer, (2010)A Theory of Loss-Leaders: Making Money by Pricing Below Cost., , , and . WINE, volume 4858 of Lecture Notes in Computer Science, page 293-299. Springer, (2007)Round Complexity of Byzantine Agreement, Revisited., , and . IACR Cryptology ePrint Archive, (2019)Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search., , , , , , and . CoRR, (2020)Fully Dynamic k-Center Clustering with Outliers., , , and . Algorithmica, 86 (1): 171-193 (January 2024)Advanced Composition Theorems for Differential Obliviousness., , , and . ITCS, volume 287 of LIPIcs, page 103:1-103:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)A Theory of Composition for Differential Obliviousness., , , and . EUROCRYPT (3), volume 14006 of Lecture Notes in Computer Science, page 3-34. Springer, (2023)Fully Dynamic k-Center Clustering., , and . WWW, page 579-587. ACM, (2018)A Tight Lower Bound for the Steiner Point Removal Problem on Trees., , , and . APPROX-RANDOM, volume 4110 of Lecture Notes in Computer Science, page 70-81. Springer, (2006)Fully Dynamic k-Center Clustering with Outliers., , , and . COCOON, volume 13595 of Lecture Notes in Computer Science, page 150-161. Springer, (2022)