( en | de | ru )

 

Disambiguation of "Abraham, Ittai"

Author of the publication

copydeleteadd this publication to your clipboard
Skip B-Trees.

, , and . OPODIS, volume 3974 of Lecture Notes in Computer Science, page 366-380. Springer, (2005)

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.

Ittai Joseph Tamari

Abraham Wilentschuk

Rainer Abraham

Günter Abraham

Norbert Abraham

 

Other publications of authors with the same name

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