( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time.

, , , и . IACR Cryptol. ePrint Arch., (2023)

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.

Ittai Joseph Tamari

Rainer Abraham

Günter Abraham

Abraham Merel

Abraham Frowein

 

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

Low-Distortion Inference of Latent Similarities from a Multiplex Social Network., , , и . SIAM J. Comput., 44 (3): 617-668 (2015)Practical Synchronous Byzantine Consensus., , , и . IACR Cryptology ePrint Archive, (2017)Using petal-decompositions to build a low stretch spanning tree., и . STOC, стр. 395-406. ACM, (2012)Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels., , и . STOC, стр. 1199-1218. ACM, (2012)Forbidden-set distance labels for graphs of bounded doubling dimension., , , и . PODC, стр. 192-200. ACM, (2010)Byzantine disk paxos: optimal resilience with byzantine shared memory., , , и . PODC, стр. 226-235. ACM, (2004)Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness., , , , и . IACR Cryptology ePrint Archive, (2019)Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus., , , , и . OPODIS, том 95 из LIPIcs, стр. 25:1-25:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)LAND: stretch (1 + epsilon) locality-aware networks for DHTs., , и . SODA, стр. 550-559. SIAM, (2004)On Approximate Distance Labels and Routing Schemes with Affine Stretch., и . DISC, том 6950 из Lecture Notes in Computer Science, стр. 404-415. Springer, (2011)