( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels.

, , и . STOC, стр. 1199-1218. ACM, (2012)

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

Abraham Wilentschuk

Rainer Abraham

Günter Abraham

Abraham Merel

 

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

LAND: stretch (1 + epsilon) locality-aware networks for DHTs., , и . SODA, стр. 550-559. SIAM, (2004)Online detection of effectively callback free objects with applications to smart contracts., , , , , , и . Proc. ACM Program. Lang., 2 (POPL): 48:1-48:28 (2018)Compact name-independent routing with minimum stretch., , , , и . SPAA, стр. 20-24. ACM, (2004)Low-Distortion Inference of Latent Similarities from a Multiplex Social Network., , , и . SIAM J. Comput., 44 (3): 617-668 (2015)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)Byzantine disk paxos: optimal resilience with byzantine shared memory., , , и . PODC, стр. 226-235. ACM, (2004)Forbidden-set distance labels for graphs of bounded doubling dimension., , , и . PODC, стр. 192-200. ACM, (2010)On Approximate Distance Labels and Routing Schemes with Affine Stretch., и . DISC, том 6950 из Lecture Notes in Computer Science, стр. 404-415. Springer, (2011)Compact Routing for Graphs Excluding a Fixed Minor., , и . DISC, том 3724 из Lecture Notes in Computer Science, стр. 442-456. Springer, (2005)