( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Efficient and DoS-resistant Consensus for Permissioned Blockchains.

, , , , , , , , , , , , и . Perform. Evaluation, (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.

Hubert H Zimmermann

Wilhelm Chan

Raquel Chan

Clifford Chan

Danny Chan

 

Другие публикации лиц с тем же именем

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