( en | de | ru )

 

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

Author of the publication

copydeleteadd this publication to your clipboard
A Random-Surfer Web-Graph Model.

, , and . ANALCO, page 238-246. SIAM, (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.

Hubert H Zimmermann

Wilhelm Chan

Raquel Chan

Clifford Chan

Denise Chan

 

Other publications of authors with the same name

Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound., , and . IACR Cryptology ePrint Archive, (2014)Private and Continual Release of Statistics., , and . ICALP (2), volume 6199 of Lecture Notes in Computer Science, page 405-417. Springer, (2010)An SDP Primal-Dual Algorithm for Approximating the Lovász-Theta Function., , and . Algorithmica, 69 (3): 605-618 (2014)Fully Dynamic Approximate k-Core Decomposition in Hypergraphs., , and . ACM Trans. Knowl. Discov. Data, 14 (4): 39:1-39:21 (2020)Opinion Dynamics with Varying Susceptibility to Persuasion via Non-Convex Local Search., , , , , , and . CoRR, (2020)Re-Revisiting Learning on Hypergraphs: Confidence Interval, Subgradient Method, and Extension to Multiclass., , , and . IEEE Trans. Knowl. Data Eng., 32 (3): 506-518 (2020)Blockchain with Varying Number of Players., , , , , and . IACR Cryptol. ePrint Arch., (2020)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)Path ORAM: An Extremely Simple Oblivious RAM Protocol., , , , , , , and . J. ACM, 65 (4): 18:1-18:26 (2018)