( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Brief announcement: on the round complexity of distributed consensus over synchronous networks.

, , , , и . PODC, стр. 397. ACM, (2004)

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.

Aman K K Bhasin

K Amann

K Kremer

K Seibert

K Böhm

 

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

Asynchronous Unconditionally Secure Computation: An Efficiency Improvement., , и . INDOCRYPT, том 2551 из Lecture Notes in Computer Science, стр. 93-107. Springer, (2002)Optimal Perfectly Secure Message Transmission., , и . CRYPTO, том 3152 из Lecture Notes in Computer Science, стр. 545-561. Springer, (2004)Efficient Asynchronous Secure Multiparty Distributed Computation., и . INDOCRYPT, том 1977 из Lecture Notes in Computer Science, стр. 117-129. Springer, (2000)Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation., и . INDOCRYPT, том 1977 из Lecture Notes in Computer Science, стр. 130-142. Springer, (2000)Asynchronous Secure Communication Tolerating Mixed Adversaries., , и . ASIACRYPT, том 2501 из Lecture Notes in Computer Science, стр. 224-242. Springer, (2002)Perfectly Reliable Message Transmission., , и . Inf. Process. Lett., 100 (1): 23-28 (2006)Distributed consensus in the presence of sectional faults., , , , и . PODC, стр. 202-210. ACM, (2003)Covering hostile terrains with partial and complete visibilities: On minimum distance paths., , , , и . IROS, стр. 2572-2577. IEEE, (2008)Theory of Equal-Flows in Networks., , , , и . COCOON, том 2387 из Lecture Notes in Computer Science, стр. 514-524. Springer, (2002)On the Power of Computational Secret Sharing., , , , и . INDOCRYPT, том 2904 из Lecture Notes in Computer Science, стр. 162-176. Springer, (2003)